Chromaticity of a family of 5-partite graphs

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/4138

Full metadata record

DC Field	Value	Language
dc.contributor.author	R. Hasni, A. Shaman	-
dc.contributor.author	G. C. Lau	-
dc.date.accessioned	2022-10-20T18:56:52Z	-
dc.date.available	2022-10-20T18:56:52Z	-
dc.date.issued	2014	-
dc.identifier.issn	1815-3852	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/4138	-
dc.description.abstract	Let P(G,k) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G H, if P(G,k) = P(H,k). We write [G]={HŒH G}. If [G]={G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 5-partite graphs G with 5n vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain stars or matching deleted parts . As a by-product, two new families of chromatically unique complete 5-partite graphs G with certain stars or matching deleted parts are obtained	en_US
dc.publisher	Journal of the Association of Arab Universities for Basic and Applied Sciences	en_US
dc.subject	Chromatic polynomia	en_US
dc.subject	Chromatically closed	en_US
dc.subject	Chromatic uniqueness	en_US
dc.title	Chromaticity of a family of 5-partite graphs	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
Chromaticity of a family of 5 partite graphs.pdf		938.59 kB	Adobe PDF	View/Open