Abstract
The -chromatic number of a graph , denoted by , is the largest positive integer such that there exists a proper coloring for G with 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 -chromatic vertex number of a -regular graph , denoted by , is the maximum number of dominant vertices of distinct colors in a proper coloring with colors. El Sahili and Kouider conjectured that for any -regular graph of girth 5. We study this conjecture by giving some partial answers under supplementary conditions.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.