Open Accessk-Zumkeller Labeling of Graphs
Author(s) -
B. J. Balamurugan,
K. Thirusangu,
D. G. Thomas,
B. J. Murali
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - Uncategorized
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21040
Subject(s) - combinatorics , indifference graph , chordal graph , mathematics , pathwidth , clique sum , 1 planar graph , graph , line graph
In this paper, we mainly focus on to prove that the graphs, viz., (i)paths, (ii) comb graphs, (iii) cycles, (iv) ladder graphs and (v) Pn´Pn graphs are k-Zumkeller graphs.