Zumkeller cordial labeling on some classes of extended duplicate graphs

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). V...

Full description

Saved in:
Bibliographic Details
Main Authors: Jegan, R., Vijayakumar, P., Thirusangu, K.
Format: Conference Proceeding
Language:English
Subjects:
Apexes
Graph theory
Graphs
Labeling
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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].
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0208462