THE LOCATING-CHROMATIC NUMBER FOR CERTAIN OF TREES
Teks penuh
Gambar
Dokumen terkait
Mary Florida, New families of integral sum graphs - edge sum class and chromatic integral sum number, Proc. and
Omoomi, “On the locating chromatic number of Kneser graphs,” Discrete Applied Mathematics: The Journal of Combinatorial Algorithms, Informatics and Computational Sciences,
Keywords and phrases: color code, locating-chromatic number, firecracker graph. This research is supported by IMHERE Research Grant 2011 and DGHE Competence Research Grant
F eigen-chromatic stability 1 The complete graphKn, onn vertices ishyper eigen-chromatically stable 2 The path graphs Pn on nvertices iseigen-chromatically unstable 3 The cycle graphs
Yulianti, On the locating chromatic number of subdivision of barbell graphs containing generalized petersen graph, International Journal of Computer Science and Network Security, Vol..
Volume7432019, Pages 460–475 Bounds on the fair total domination number in trees and unicyclic graphs Majid Hajian Department of Mathematics Shahrood University of Technology
We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving
In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph 𝑃𝑛⊙ 𝐾1, central graph of comb graph 𝐶𝑃𝑛⊙ 𝐾1, middle graph of comb graph
