Volume 53, Number 4, October 2019
|Page(s)||1187 - 1195|
|Published online||29 July 2019|
Some results on the b-chromatic number in complementary prism graphs
Laboratory of Mechanics, Physics and Mathematical Modeling Faculty of Sciences, University of Médéa, Algeria
2 Department of Mathematics and Computer Science Faculty of Sciences, University of Médéa, Algeria
3 LAMDA-RO Laboratory Department of Mathematics, University of Blida 1, B.P. 270 Blida, Algeria
* Corresponding author: firstname.lastname@example.org
Accepted: 27 June 2018
A b-coloring of a graph G is a proper coloring of G with k colors such that each color class has a vertex that is adjacent to at least one vertex of every other color classes. The b-chromatic number is the largest integer k for which G has a b-coloring with k colors. In this paper, we present some results on b-coloring in complementary prism graphs.
Mathematics Subject Classification: 05C15
Key words: b-coloring / b-chromatic number / complementary prism graph
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.