The b-chromatic number of G, denoted by ϕ(G), is the maximum k for which G has a b-coloring by k colors. A b-coloring of G by k colors is a proper k-coloring of the vertices of G such that in each color class i there exists a vertex x_{i} having neighbors in all the other k-1 color classes. Such a vertex x_{i} is called a b-dominating vertex, and the set of vertices {x₁,x₂…x_{k}} is called a b-dominating system. In this paper, we are going to investigate on the b-chromatic number of Central graph of Triangular Snake graph, Sunlet graph, Helm Graph, Double Triangular Snake graph, Gear graph, and Closed Helm graph are denoted as C(T_{n}), C(S_{n}), C(H_{n}), C(DT_{n}), C(G_{n}), C(CH_{n}) respectively.
| Primary Language | English | 
|---|---|
| Journal Section | Review Articles | 
| Authors | |
| Publication Date | February 1, 2019 | 
| Submission Date | February 5, 2018 | 
| Acceptance Date | August 26, 2018 | 
| Published in Issue | Year 2019 Volume: 68 Issue: 1 | 
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics
This work is licensed under a Creative Commons Attribution 4.0 International License.