Chromaticity of a family of K 4-homeomorph with Girth 9
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...
Main Authors: | Hasni, R. (Author), Karim, N.S.A (Author), Lau, G.C (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
American Institute of Physics Inc.
2014
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
Similar Items
-
Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
by: N.S.A. Karim, et al.
Published: (2016-04-01) -
Chromatically unique 6-bridge graph θ(a, a, a, b, b, c)
by: Hasni, R., et al.
Published: (2016) -
On the chromaticity of complete multipartite graphs with certain edges added
by: Lau, G.C, et al. -
Chromatically unique 6-bridge graph theta(a, a, a, b, b, c)
by: Hasni, R, et al.
Published: (2016) -
A result on co-chromatic graphs
by: E. J. Farrell
Published: (1981-01-01)