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.

Bibliographic Details
Main Authors:	G. JOTHILAKSHMI, A. P. PUSHPALATHA, S. SUGANTHI, V. SWAMINATHAN
Format:	Article
Language:	English
Published:	Isik University 2016-12-01
Series:	TWMS Journal of Applied and Engineering Mathematics
Subjects:	distance r-independent color partition dis- tance r-independent set distance r-chromatic number distance r-independent set distance r-b-coloring number
Online Access:	http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/261-some-results-on-the-distance-r-b-coloring-in-graphs

Internet

http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/261-some-results-on-the-distance-r-b-coloring-in-graphs

SOME RESULTS ON THE DISTANCE r-b-COLORING IN GRAPHS

Internet

Similar Items