Chromaticity of 6-bridge graph θ(3,3,3,b,c,d)

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Abd. Karim, N.S.	-
dc.contributor.author	Hasni, R.	-
dc.date.accessioned	2017-05-21T08:36:22Z	-
dc.date.available	2017-05-21T08:36:22Z	-
dc.date.issued	2016	-
dc.identifier.citation	Vol.10; 155-166 p.	en_US
dc.identifier.issn	1823 8343	-
dc.identifier.uri	http://hdl.handle.net/123456789/5945	-
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 x-equivalent), denoted by G∼H, if P(G, λ) = P(H, λ). A graph G is chromatically unique (or simply x-unique) if for any graph H such that H∼G, we have H ≅ G, that is, H is isomorphic to G. In this paper, the chromatic uniqueness of a family of 6-bridge graph is determined	en_US
dc.language.iso	en	en_US
dc.publisher	Malaysian Journal of Mathematical Sciences	en_US
dc.subject	6-bridge graph	en_US
dc.subject	Chromatic polynomial	en_US
dc.subject	Chromatically unique	en_US
dc.title	Chromaticity of 6-bridge graph θ(3,3,3,b,c,d)	en_US
dc.type	Article	en_US
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
J2016-363-Chromaticity of 6-bridge Graph θ(3, 3, b, b, c, c).pdf	Evidence	145.67 kB	Adobe PDF	View/Open

DSpace JSPUI