Abstract
Given a graph G, b coloring seeks a proper coloring of G with the descriptive property that every color class in the graph contains a dominating vertex. We have to minimize the number of colors in proper coloring. In this paper, we show how chromatic and b-chromatic number of a graph changes with the graph operators and relation between chromatic and b-chromatic number has been explored.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
