Chromatic equivalence classes of certain cycles with edges
Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G∼H, if P(G) = P(H). A graph G is chromatically unique if for any graph H, G∼H implies that G is isomorphic with H. In this paper, we give the necessary and sufficient conditions for a fam...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2001
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114099/1/114099.pdf |
| _version_ | 1824452363885215744 |
|---|---|
| author | Omoomi, Behnaz Peng, Yee-Hock |
| author_facet | Omoomi, Behnaz Peng, Yee-Hock |
| author_sort | Omoomi, Behnaz |
| collection | UPM |
| description | Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G∼H, if P(G) = P(H). A graph G is chromatically unique if for any graph H, G∼H implies that G is isomorphic with H. In this paper, we give the necessary and sufficient conditions for a family of generalized polygon trees to be chromatically unique. © 2001 Elsevier Science B.V. All rights reserved. |
| first_indexed | 2025-02-19T02:49:20Z |
| format | Article |
| id | upm.eprints-114099 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2025-02-19T02:49:20Z |
| publishDate | 2001 |
| record_format | dspace |
| spelling | upm.eprints-1140992024-12-10T01:45:25Z http://psasir.upm.edu.my/id/eprint/114099/ Chromatic equivalence classes of certain cycles with edges Omoomi, Behnaz Peng, Yee-Hock Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G∼H, if P(G) = P(H). A graph G is chromatically unique if for any graph H, G∼H implies that G is isomorphic with H. In this paper, we give the necessary and sufficient conditions for a family of generalized polygon trees to be chromatically unique. © 2001 Elsevier Science B.V. All rights reserved. 2001 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/114099/1/114099.pdf Omoomi, Behnaz and Peng, Yee-Hock (2001) Chromatic equivalence classes of certain cycles with edges. Discrete Mathematics, 232 (1-3). pp. 175-183. ISSN 0012-365X; eISSN: 0012-365X https://linkinghub.elsevier.com/retrieve/pii/S0012365X00003551 10.1016/s0012-365x(00)00355-1 |
| spellingShingle | Omoomi, Behnaz Peng, Yee-Hock Chromatic equivalence classes of certain cycles with edges |
| title | Chromatic equivalence classes of certain cycles with edges |
| title_full | Chromatic equivalence classes of certain cycles with edges |
| title_fullStr | Chromatic equivalence classes of certain cycles with edges |
| title_full_unstemmed | Chromatic equivalence classes of certain cycles with edges |
| title_short | Chromatic equivalence classes of certain cycles with edges |
| title_sort | chromatic equivalence classes of certain cycles with edges |
| url | http://psasir.upm.edu.my/id/eprint/114099/1/114099.pdf |
| work_keys_str_mv | AT omoomibehnaz chromaticequivalenceclassesofcertaincycleswithedges AT pengyeehock chromaticequivalenceclassesofcertaincycleswithedges |