The bb-Chromatic Number and ff-Chromatic Vertex Number of Regular Graphs

preprint2013arXivOpen access

Abstract

The bb-chromatic number of a graph GG, denoted by b(G)b(G), is the largest positive integer kk such that there exists a proper coloring for G with kk colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The ff-chromatic vertex number of a dd-regular graph GG, denoted by f(G)f(G), is the maximum number of dominant vertices of distinct colors in a proper coloring with d+1d+1 colors. El Sahili and Kouider conjectured that b(G)=d+1b(G)=d+1 for any dd-regular graph GG of girth 5. We study this conjecture by giving some partial answers under supplementary conditions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.