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

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

Given a positive integer r, two vertices u; v 2 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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TWMS journal of applied and engineering mathematics 2016-07, Vol.6 (2), p.315
Hauptverfasser: Jothilakshmi, G, Pushpalatha, A.P, Suganthi, S, Swaminathan, V
Format: Artikel
Sprache:eng
Schlagworte:
Coloring
Graph theory
Mathematical research
Product design
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given a positive integer r, two vertices u; v 2 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.
ISSN:2146-1147
2146-1147