Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/13789
Title: Note on b-colorings in Harary graphs
Authors: Zoham, Zemir
Noureddine, Ikhlef Eschouf
Mostafa, Blidia
Keywords: Coloration
b-chromatic number
AMS Subject Classification: 05C69
Issue Date: 24-Apr-2017
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
Description: Septième Colloque sur l’Optimisation et les Systèmes d’Information - COSI’2010
URI: http://dspace.univ-ouargla.dz/jspui/handle/123456789/13789
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
Zoham Zemir.pdf196,13 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.