Share Your Research, Maximize Your Social Impacts
The b-chromatic number of some graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.5, No. 1)Publication Date: 2015.01.01
Authors : S K Vaidya; Rakhimol V. Isaac;
Page : 165-169
Keywords : Graph coloring; b-coloring; b-vertex;
Source : Download
Find it from : Google Scholar
Abstract
A proper coloring of a graph G is called b-coloring if each color class contains a vertex which is adjacent to at least one vertex of every other color classes. We investigate b-chromatic number of some cycle and path related graphs.
Other Latest Articles
- Fetal Pain and Fetal Anesthesia Techniques
- 3-equitable labeling in context of the barycentric subdivision of some special graphs
- Some new families of 5-cordial graphs
- Weight Gain with the Levonorgestrel-Releasing Intrauterine System (LNG-IUS) Versus Depot Medroxyprogesterone Acetate (DMPA) Among Post- Partum Adolescents through 12 Months of Follow-up
- Square graceful labelings of some subdivision graphs
Last modified: 2017-08-30 19:26:16