On b-chromatic number of sun let graph and wheel graph families | ||||
Journal of the Egyptian Mathematical Society | ||||
Volume 23, Issue 2, 2015, Page 215-218 PDF (684.2 K) | ||||
Document Type: Communication | ||||
DOI: 10.1016/j.joems.2014.05.011 | ||||
![]() | ||||
Authors | ||||
J. Vernold Vivin* 1; M. Vekatachalam2 | ||||
1Department of Mathematics, University College of Engineering Nagercoil, Anna University, Tirunelveli Region, Nagercoil 629 004, Tamil Nadu, India | ||||
2Department of Mathematics, RVS Educational Trust’s Group of Institutions, RVS Faculty of Engineering, Coimbatore 641 402, Tamil Nadu, India | ||||
Abstract | ||||
A proper coloring of the graph assigns colors to the vertices, edges, or both so that proximal elements are assigned distinct colors. Concepts and questions of graph coloring arise naturally from practical problems and have found applications in many areas, including Information Theory and most notably Theoretical Computer Science. A b-coloring of a graph G is a proper coloring of the vertices of G such that there exists a vertex in each color class joined to at least one vertex in each other color class. The b-chromatic number of a graph G, denoted by uðGÞ, is the maximal integer k such that G may have a b-coloring with k colors. In this paper, we obtain the b-chromatic number for the sun let graph Sn, line graph of sun let graph LðSnÞ, middle graph of sun let graph MðSnÞ, total graph of sun let graph TðSnÞ, middle graph of wheel graph MðWnÞ and the total graph of wheel graph TðWnÞ. | ||||
Keywords | ||||
b-coloring; Sun let graph; Wheel graph; Middle graph; Total graph and line graph | ||||
Statistics Article View: 60 PDF Download: 31 |
||||