Some results on the distance r-b-coloring in graphs
Citation
Jothilakshmi, G., Pushpalatha, A.P., Suganthi, S. & Swaminathan, V. (2016). Some results on the distance r-b-coloring in graphs. TWMS Journal of Applied and Engineering Mathematics, 6(2), 315-323.Abstract
Given a positive integer r, two vertices u, v ? V (G) are r- independent if d(u, v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.
Volume
6Issue
2URI
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2602http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/261
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess
