On chromatic uniqueness of certain 5-partite graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	H. Roslan, A.S. Ameen	-
dc.contributor.author	Y.H. Peng, H.X. Zhao	-
dc.date.accessioned	2022-10-20T08:26:05Z	-
dc.date.available	2022-10-20T08:26:05Z	-
dc.date.issued	2011	-
dc.identifier.issn	1598-5865	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3762	-
dc.description.abstract	Let P(G,λ) 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,λ) = P(H,λ). 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 with 5n+3 vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 5-partite graphs with certain star or matching deleted are obtained.	en_US
dc.publisher	J Appl Math Comput	en_US
dc.subject	Chromatic polynomial	en_US
dc.subject	Chromatically closed	en_US
dc.subject	Chromatic uniqueness	en_US
dc.title	On chromatic uniqueness of certain 5-partite graphs	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
On chromatic uniqueness of certain 5-partite graphs.pdf		138.16 kB	Adobe PDF	View/Open