A b-coloring is a proper vertex coloring of a graph such that each color class contains a
vertex that has a neighbor in all other color classes and the b-chromatic number is the …

The b-chromatic index φ′(G) of a graph G is the largest integer k such that G admits a
proper k-edge coloring in which every color class contains at least one edge incident to …

The b-chromatic number of a graph GG is a maximum integer φ (G) φ (G) for which there
exists a proper φ (G) φ (G)-coloring with the additional property that each color class …

The b-chromatic index φ'(G) φ′(G) of a graph GG is the largest integer kk such that GG
admits a proper k k-edge coloring in which every color class contains at least one edge …

Distance r-Coloring and Distance r-Dominator Coloring number of a graph ... Home Articles
Current Issue Archives Authors Author Guidelines Policies Downloads Editors Reviewers …

SOME RESULTS ON THE DISTANCE rb-COLORING IN GRAPHS 1. Introduction Consider a
network and a coloring scheme for the nodes. Two Page 1 TWMS J. App. Eng. Math. V.6 …