A new family of chromatically unique 6-bridge graph.

dc.creator	Karim, N. S. A.
dc.creator	Hasni, R.
dc.date	2018-06-07
dc.date.accessioned	2019-11-14T12:01:14Z
dc.date.available	2019-11-14T12:01:14Z
dc.identifier	https://www.revistaproyecciones.cl/article/view/2933
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/113640
dc.description	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. In this paper, the chromatic uniqueness of a new family of 6-bridge graph θ(a, a, b, b, b, c) where 2 ≤ a ≤ b ≤ c, is investigated.	en-US
dc.format	application/pdf
dc.language	eng
dc.publisher	Universidad Católica del Norte.	es-ES
dc.relation	https://www.revistaproyecciones.cl/article/view/2933/2769
dc.rights	Derechos de autor 2018 Proyecciones. Journal of Mathematics	es-ES
dc.source	Proyecciones. Journal of Mathematics; Vol 37 No 2 (2018); 239-263	en-US
dc.source	Proyecciones. Revista de Matemática; Vol. 37 Núm. 2 (2018); 239-263	es-ES
dc.source	0717-6279
dc.source	0716-0917
dc.subject	Chromatic polynomial	en-US
dc.subject	Chromatically unique	en-US
dc.subject	6-bridge graph	en-US
dc.title	A new family of chromatically unique 6-bridge graph.	en-US
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES