A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper
we characterize graphs admitting an edge product cordial labeling. Using this …

Abstract Let G=(V (G), E (G)) be a graph with V (G)= S< sub> 1</sub>∪ S< sub>
2</sub>∪···∪ S< sub> t</sub>∪ T, where each S< sub> i</sub> is a set of all the vertices …

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 …

Edge and Total Edge Product Cordial Labeling of Some New Graphs Page 1 www.IndianJournals.com
Members Copy, Not for Commercial Sale Downloaded From IP - 66.249.68.71 on dated 7-Dec-2023 …

In this paper, we present some properties of Edge Product Cordial graphs and make a
survey on all graphs of order at most 6 to find out whether they are Edge Product Cordial or …

In this paper, we present some properties of Edge Product Cordial graphs and make a
survey on all graphs of order at most 6 to find out whether they are Edge Product Cordial or …