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

Title:	Chromaticity of 6-bridge graph θ(3,3,3,b,c,d)
Authors:	Abd. Karim, N.S. Hasni, R.
Keywords:	6-bridge graph Chromatic polynomial Chromatically unique
Issue Date:	2016
Publisher:	Malaysian Journal of Mathematical Sciences
Citation:	Vol.10; 155-166 p.
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
URI:	http://hdl.handle.net/123456789/5945
ISSN:	1823 8343
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