Header menu link for other important links
The b-chromatic number of some special families of graphs
Published in IOP Publishing
Volume: 263
Issue: 4
Given G, b - coloring is a proper k coloring of G in which each and every color class has at least one b - vertex that has a neighbour in other k - 1 color classes. The largest integer k is the b - chromatic number b(G) for which G having a b - coloring using k colors. In this paper, we constructed some family of graphs and found its b - chromatic number. © Published under licence by IOP Publishing Ltd.
About the journal
JournalData powered by TypesetIOP Conference Series: Materials Science and Engineering
PublisherData powered by TypesetIOP Publishing
Open AccessYes