Dergiler / TWMS Journal of Applied and Engineering Mathematics / 2016 / Cilt: 6 - Sayı: 2

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

G. JOTHİLAKSHMİ, A. P. PUSHPALATHA, S. SUGANTHİ, V. SWAMİNATHAN

Sayfa
315–323
DOI
—

Abstract

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.

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