Complete Solution To Chromatic Uniqueness Of K 4 -Homeomorphs With Girth 9

Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/5987

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nor Suriya, Abd Karim	-
dc.contributor.author	Roslan, Hasni	-
dc.contributor.author	Gee, Choon Lau	-
dc.date.accessioned	2017-05-21T08:41:57Z	-
dc.date.available	2017-05-21T08:41:57Z	-
dc.date.issued	2016-10-21	-
dc.identifier.citation	Vol.16 (2016);144-152p.	en_US
dc.identifier.issn	1607 2510	-
dc.identifier.uri	http://hdl.handle.net/123456789/5987	-
dc.description.abstract	For a graph G , let P ( G; ) denote the chromatic polynomial of G . Two graphs G and H are chromatically equivalent (or simply -equivalent), denoted by G H , if P ( G; ) = P ( H; ) . A graph G is chromatically unique (or simply -unique) if for any graph H such as H G , we have H = G , i.e. H is isomorphic to G . A K 4 -homeomorph is a subdivision of the complete graph K 4 . In this paper, we completely determine the chromaticity of K 4 -homeomorphs which has girth 9, and give su¢ cient and necessary condition for the graphs in the family to be chromatically unique	en_US
dc.language.iso	en	en_US
dc.publisher	Applied Mathematics E-Notes	en_US
dc.subject	Mathematics	en_US
dc.title	Complete Solution To Chromatic Uniqueness Of K 4 -Homeomorphs With Girth 9	en_US
dc.type	Article	en_US
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
J2016-306-Complete solution to chromatic uniqueness of K4-homeomorphs with girth 9.pdf	Fulltext	138.84 kB	Adobe PDF	View/Open