Advances and Applications in Discrete Mathematics
Volume 16, Issue 1, Pages 1 - 12
(July 2015) http://dx.doi.org/10.17654/AADMJul2015_001_012 |
|
SOME NEW RESULTS ON b-COLORING OF GRAPHS
Samir K. Vaidya and Minal S. Shukla
|
Abstract: A proper coloring is called a b-coloring if there exists a vertex that has neighbour(s) in all other color classes. The b-chromatic number of a graph is the largest integer for which graph admits a b-coloring. We investigate the b-chromatic numbers for some graphs obtained from wheel and flower graph. |
Keywords and phrases: b-coloring, b-continuity, b-spectrum. |
|
Number of Downloads: 353 | Number of Views: 921 |
|