The equitable chromatic numbers of some graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	NOURI, Sarah	-
dc.contributor.author	BENDRAOUCHE, Mohamed	-
dc.date.accessioned	2019-06-19T09:49:26Z	-
dc.date.available	2019-06-19T09:49:26Z	-
dc.date.issued	2019-03-05	-
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/20861	-
dc.description	Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019	en_US
dc.description.abstract	A k-equitable coloring of a graph G is a proper coloring of G with k colors such that the sizes of any two different classes of colors differ by at most one. The minimum integer k such that G admits a k-equitable coloring is called the equitable chromatic number of G and is denoted by χ=(G). In this paper, we determine the equitable chromatic numbers of the generalized Petersen graphs deﬁned by Watkins and some corona graphs.	en_US
dc.language.iso	en	en_US
dc.publisher	Université Kasdi Merbah Ouargla	en_US
dc.relation.ispartofseries	2019;	-
dc.subject	Proper coloring	en_US
dc.subject	Equitable coloring	en_US
dc.subject	Generalized Petersen graphs	en_US
dc.title	The equitable chromatic numbers of some graphs	en_US
dc.type	Article	en_US
Appears in Collections:	2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:

File	Description	Size	Format
NOURI Sarah.pdf		510,43 kB	Adobe PDF	View/Open

DSpace JSPUI