Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/12039
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zoham, Zemir | - |
dc.contributor.author | Noureddine, Ikhlef | - |
dc.contributor.author | Eschouf, z | - |
dc.date.accessioned | 2016-11-07T08:47:28Z | - |
dc.date.available | 2016-11-07T08:47:28Z | - |
dc.date.issued | 2016-11-07 | - |
dc.identifier.uri | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12039 | - |
dc.description.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 | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | 2015; | - |
dc.subject | Coloration | en_US |
dc.subject | b-coloring | en_US |
dc.subject | b-chromatic number | en_US |
dc.title | Note on b-colorings in Harary graphs | en_US |
dc.type | Article | en_US |
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.