Some results on the distance r-b-coloring in graphs

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.Publisher's Versio