A Note on the b-Chromatic Number of Corona of Graphs

被引:3
|
作者
Lisna, P. C. [1 ]
Sunitha, M. S. [1 ]
机构
[1] Natl Inst Technol Calicut, Dept Math, Kozhikode 673601, Kerala, India
关键词
Cycles; star graph; wheel graph; corona of graphs; b-chromatic number; b-dominating set;
D O I
10.1142/S0219265915500048
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 classes. The b-chromatic number of a graph G, denoted by phi(G), is the maximal integer k such that G has a b-coloring with k colors. In this paper, the b-chromatic numbers of the coronas of cycles, star graphs and wheel graphs with different numbers of vertices, respectively, are obtained. Also the bounds for the b-chromatic number of corona of any two graphs is discussed.
引用
收藏
页数:14
相关论文
共 50 条