On Chromatic Uniqueness of Complete Complete 6-Partite Graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	R. Hasni, A. Shaman	-
dc.contributor.author	S. Alikhani	-
dc.date.accessioned	2022-10-20T07:56:24Z	-
dc.date.available	2022-10-20T07:56:24Z	-
dc.date.issued	2014	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3733	-
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 G with 6n + i vertices for i = 0, 1, 2 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 G with certain star or matching deleted are obtained	en_US
dc.publisher	International Mathematical Forum	en_US
dc.subject	Chromatic Polynomial	en_US
dc.subject	Chromatically Closed	en_US
dc.title	On Chromatic Uniqueness of Complete Complete 6-Partite Graphs	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
On Chromatic Uniqueness of Complete.pdf		173.63 kB	Adobe PDF	View/Open