The b-chromatic number of certain graphs and digraphs

被引:5
作者
Kok, Johan [1 ]
Sudev, N. K. [2 ]
机构
[1] Tshwane Metropolitan Police Dept, City Of Tshwane, South Africa
[2] Vidya Acad Sci & Technol, Dept Math, Thalakkottukara 680501, Thrissur, India
关键词
b-Chromatic number; Set-graphs; Edge-set graphs; Jaco graph; Ornated graphs; Rasta graph; Chithra graph;
D O I
10.1080/09720529.2016.1160512
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The b-chromatic number of a graph G is the maximum number k of colours in a proper colouring of G, such that at least one vertex in each colour class has a neighbour in all other classes. In this paper, we discuss the b-chromatic number of certain classes of graphs and digraphs.
引用
收藏
页码:435 / 445
页数:11
相关论文
共 12 条
[1]  
Bondy JA., 1976, GRADUATE TEXTS MATH
[2]  
Chartrand G., 2000, GRAPHS DIGRAPHS, V3rd ed
[3]  
Effatin B., 2003, DISCRETE MATH THEOR, V6
[4]   The b-chromatic number of a graph [J].
Irving, RW ;
Manlove, DF .
DISCRETE APPLIED MATHEMATICS, 1999, 91 (1-3) :127-141
[5]  
Kok J., 2015, INT J COMPUTER APPL, V118, P1, DOI [10.5120/20754-3173, DOI 10.5120/20754-3173]
[6]  
Kok J., ARXIV14037916V3
[7]  
Kok J., 2015, INT J COMPUTER APPL, V127, P1, DOI [10.5120/ijca2015906385, DOI 10.5120/IJCA2015906385]
[8]  
Kok J., 2016, SE ASIAN B IN PRESS
[9]  
Kok J, 2015, J INFORM MATH SCI, V7, P69
[10]   A study on total irregularities of certain graphs and digraphs [J].
Kok, Johan ;
Sudev, Naduvath .
COGENT MATHEMATICS, 2016, 3 (01)