Switching of a Vertex in Path and $b$-coloring


Abstract views: 34 / PDF downloads: 29

Authors

  • Samir K. Vaidya Department of Mathematics, Saurashtra University, Rajkot, Gujarat, India
  • Minal S. Shukla Atmiya Institute of Technology and Science, Rajkot, Gujarat, India

Keywords:

Coloring, b-coloring, b-continuity

Abstract

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

15-09-2015

How to Cite

Samir K. Vaidya, & Minal S. Shukla. (2015). Switching of a Vertex in Path and $b$-coloring. International Journal of Mathematics And Its Applications, 3(3 - A), 85–91. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/449

Issue

Vol. 3 No. 3 - A (2015)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.