Note on b-colorings in Harary graphs

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/2950

Full metadata record

DC Field	Value	Language
dc.contributor.author	Zoham Zemiry , Noureddine Ikhlef Eschouf z	-
dc.date.accessioned	2013-12-19T15:30:37Z	-
dc.date.available	2013-12-19T15:30:37Z	-
dc.date.issued	2013-12-19	-
dc.identifier.issn	kh	-
dc.identifier.uri	http://hdl.handle.net/123456789/2950	-
dc.description	7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010	en_US
dc.description.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 H2m;n which is the Harary graph Hk;n 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	en_US
dc.language.iso	en	en_US
dc.subject	Coloration	en_US
dc.subject	b-coloring	en_US
dc.subject	b-chromatic number. AMS Sub ject Classi…cation: 05C69.	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
Zoham Zemir.pdf		196,13 kB	Adobe PDF	View/Open

DSpace JSPUI