A Remark on Chromatically Unique 5-Partite Graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Roslan Hasni, Ameen Shaman Ameen	-
dc.date.accessioned	2022-10-20T19:40:31Z	-
dc.date.available	2022-10-20T19:40:31Z	-
dc.date.issued	2013	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/4164	-
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, two new families of chromatically unique complete 5-partite graphs G having 5n+4 vertices with certain star or matching deleted are obtained	en_US
dc.publisher	Applied Mathematical Sciences	en_US
dc.subject	: Chromatic Polynomial	en_US
dc.subject	Chromatically Closed	en_US
dc.subject	Chromatic Uniqueness	en_US
dc.title	A Remark on Chromatically Unique 5-Partite Graphs	en_US
dc.type	Article	en_US
Appears in Collections:	قسم الرياضيات التطبيقية

Files in This Item:

File	Description	Size	Format
A Remark on Chromatically Unique 5-Partite Graphs.pdf		141.27 kB	Adobe PDF	View/Open