Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/12039
Title: | Note on b-colorings in Harary graphs |
Authors: | Zoham, Zemir Noureddine, Ikhlef Eschouf, z |
Keywords: | Coloration b-coloring b-chromatic number |
Issue Date: | 7-Nov-2016 |
Series/Report no.: | 2015; |
Abstract: | Abstract A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes. The b-chromatic number b(G) is the largest integer k such that G admits a b-coloring with k colors. In this note, according to the values taken by the order n of a graph, we determine exact values or bounds for the b-chromatic number of H 2m;n which is the Harary graph H when k is even: Therefore our result improves the result concerning the b-chromatic of p-th power graphs of cycles and give a negative answer to the open problem of E⁄antin and Kheddouci. k;n |
URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12039 |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Note on b-colorings in Harary graphs.pdf | 196,99 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.