The b-chromatic number of certain graphs and digraphs. (3rd March 2016)

• Record Type: Journal Article
• Authors: Kok, Johan; Sudev, N. K.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 435
• Page End: 445
• Publication Date: 2016-03-03
• Subjects: b-Chromatic number -- Set-graphs -- Edge-set graphs -- Jaco graph -- Ornated graphs -- Rasta graph -- Chithra graph; Mathematics Subject Classification: 05C05 -- 05C20 -- 05C38 -- 05C62.; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2016.1160512
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: 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.