Switching of a Vertex in Path and $b$-coloring
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Coloring, b-coloring, b-continuityAbstract
A proper coloring in which every color class has a vertex adjacent to at least one vertex in every other color classes is called $b$-coloring. The $b$-chromatic number of a graph is the largest integer for which graph admits a $b$-coloring. We investigate the $b$-chromatic number for the graphs obtained from path by means of switching of a vertex.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.