ABSTRACT

In this chapter, the authors consider simple, finite, connected and undirected graphs. Variants of cordial labeling are known as equitable labeling, and edge product cordial labeling and total edge product cordial labeling are such equitable labelings. The wheel graph is not an edge product cordial graph while it is a total edge product cordial graph. The theory of graphs has a close interaction with many branches of mathematics and social sciences like discrete mathematics, network theory, information system and social network analysis. The authors consider two of the equitable labelings called edge product cordial labeling and total edge product cordial labeling and study them in the context of the larger graph obtained by graph operations.