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: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Institute of Physics Inc.
2014
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |
| LEADER | 01599nas a2200277Ia 4500 | ||
|---|---|---|---|
| 001 | 10.1063-1.4887650 | ||
| 008 | 220112c20149999CNT?? ? 0 0und d | ||
| 020 | |a 0094243X (ISSN); 9780735412415 (ISBN) | ||
| 245 | 1 | 0 | |a Chromaticity of a family of K 4-homeomorph with Girth 9 |
| 260 | 0 | |b American Institute of Physics Inc. |c 2014 | |
| 856 | |z View Fulltext in Publisher |u https://doi.org/10.1063/1.4887650 | ||
| 856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904608563&doi=10.1063%2f1.4887650&partnerID=40&md5=54d566f5e873b7026766b03b60937eab | ||
| 520 | 3 | |a 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 K4-homeomorph is a subdivision of the complete graph K4. In this paper, we investigate the chromaticity of one family of K4-homeomorph which has girth 9, and give sufficient and necessary condition for the graph in the family to be chromatically unique. © 2014 AIP Publishing LLC. | |
| 650 | 0 | 4 | |a Chromatic polynomial |
| 650 | 0 | 4 | |a Chromatic polynomials |
| 650 | 0 | 4 | |a chromaticity |
| 650 | 0 | 4 | |a Complete graphs |
| 650 | 0 | 4 | |a Cultivation |
| 650 | 0 | 4 | |a Graph G |
| 650 | 0 | 4 | |a Graph theory |
| 650 | 0 | 4 | |a Sufficient and necessary condition |
| 650 | 0 | 4 | |a Sustainable development |
| 650 | 0 | 4 | |a Two-graphs |
| 700 | 1 | 0 | |a Hasni, R. |e author |
| 700 | 1 | 0 | |a Karim, N.S.A. |e author |
| 700 | 1 | 0 | |a Lau, G.C. |e author |