Author/Authors :
JOTHILAKSHMI, G Department of Mathematics - Thiagarajar College of Engineering - Madurai, India , PUSHPALATHA, A. P Department of Mathematics - Thiagarajar College of Engineering - Madurai, India , SUGANTHI, S Department of Mathematics - Thiagarajar College of Engineering - Madurai, India , SWAMINATHAN, V Ramanujan Research Centre - Saraswathy Narayanan College - Madurai, India
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.
Keywords :
distance r-chromatic number , distance r-independent color partition , distance r-independent set , distance r-b-coloring number
