A Note on Chromaticity of Certain 6-Partite Graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	A.Sh. Ameen, Y.H. Peng	-
dc.contributor.author	H. Roslan	-
dc.date.accessioned	2022-10-20T20:34:13Z	-
dc.date.available	2022-10-20T20:34:13Z	-
dc.date.issued	2010	-
dc.identifier.issn	2078-0966	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/4186	-
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 6-partite graphs with 6n+ 3 vertices according to the number of 7-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 6-partite graphs with certain star or matching deleted are obtained	en_US
dc.subject	Chromatic Polynomial	en_US
dc.subject	Chromatically Closed,	en_US
dc.subject	Chromatic Uniqueness	en_US
dc.title	A Note on Chromaticity of Certain 6-Partite Graphs	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
A Note on Chromaticity of Certain 6-Partite.pdf		618.77 kB	Adobe PDF	View/Open