Journals / Communications Faculty of Sciences University of Ankara Series A1: Mathematics and Statistics / 2019 / Cilt: 68 - Sayı: 1
ON bCOLORING OF CENTRAL GRAPH OF SOME GRAPH
- Journal
- Communications Faculty of Sciences University of Ankara Series A1: Mathematics and Statistics
- Pages
- 1229–1239
- DOI
- —
Abstract
The bchromatic number of G, denoted by '(G), is the maximumk for which G has a bcoloring by k colors. A bcoloring of G by k colors is aproper k-coloring of the vertices of G such that in each color class i there existsa vertex xi having neighbors in all the other k 1 color classes. Such a vertexxi is called a bdominating vertex, and the set of vertices fx1; x2 : : : xkg iscalled a bdominating system. In this paper, we are going to investigate onthe bchromatic number of Central graph of Triangular Snake graph, Sunletgraph, Helm Graph, Double Triangular Snake graph, Gear graph, and ClosedHelm graph are denoted as C(Tn), C(Sn), C(Hn), C(DTn), C(Gn), C(CHn)respectively.