The b-Chromatic Colouring of Comb Product of Graphs

会议论文
发表日期：

2024年

查看全文

K. P. Thilagavathy,
N. Rakshetha,
S. Sriram

摘要

A graph’s chromatic number, \(\chi (G)\) , is the least number of colors required to appropriately color each vertex in \(G\) so that no two neighboring nodes have the identical color. In the year 1999 Irving and Manlove first proposed the idea of b-chromatic number. This study discusses the b- coloring of comb product of few graphs and determines the b-chromatic number.