Volume 18, No. 6, 2021
PQ - Sum Divisor Cordial graphs
D.Jaspin Jeba , G.Sudhana
Abstract
Graph labeling is an assignment of integers to the vertices or edges or both depending on certain conditions. A graph G with p vertices and q edges is said to admit PQ- sum divisor cordial labeling if the labeling h from V(G) to {1,2,… ,p} induces a mapping as with the condition that , where is the number of edges labeled with k. A graph which admits a PQ- sum divisor cordial labeling is called a PQ- sum divisor cordial graph. In this paper, we prove that the path , cycle , star graph , bistar graph , the subdivision graph of the star and bistar graphs and , the splitting graph of the star graph , the fan graph , the vertex switching of the path and the cycle, the graphs and P_n?K_1 are PQ- sum divisor cordial graphs.
Pages: 5331-5339
Keywords: labeling, cordial labeling, sum divisor cordial labeling.