Zumkeller cordial labeling on some classes of extended duplicate graphs
R. Jegan, P. Vijayakumar, K. Thirusangu · AIP conference proceedings · 2024
Graph labeling idea was first proposed by Rosa in 1967.An assignment of values to the components of a graph subject to specific constraint(s) is known as graph labeling.If the vertices (or edges) are mapped to a set of numbers, then the labeling is called a vertex labeling (or an edge labeling).Various labeling of graphs have been probed in interim period in over 2000 papers [5].E. Sampath kumar initiated the duplicate graphs and established many outcomes [7].K. Thirusangu, et al. verified that the duplicate graph of ladder graph is total cordial and prime cordial [8].Peng, Y., Bhaskara Rao, K.P.S. studied the properties of Zumkeller numbers in detail [6].The theory of k-Zumkeller labeling had been analyzed in the literature [1,2,3,4].