THE b-CHROMATIC NUMBER OF STAR GRAPH FAMILIES
J. Vernold Vivin, Mathiyazhagan Venkatachalam
Abstract
J. Vernold Vivin, Mathiyazhagan Venkatachalam
Abstract
In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively. We discuss the relationship between b-chromatic number with some other types of chromatic numbers such as chromatic number, star chromatic number and equitable chromatic number.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively. We discuss the relationship between b-chromatic number with some other types of chromatic numbers such as chromatic number, star chromatic number and equitable chromatic number.
Key concepts: Chromatic scale, Friendship graph, Windmill graph, Combinatorics, Graph, Mathematics, Foster graph, Star (game theory)