Chromatic equivalence classes of certain generalized polygon trees
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). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the e...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English English |
Published: |
Elsevier Science
1997
|
Online Access: | http://psasir.upm.edu.my/id/eprint/51078/1/51078.pdf http://psasir.upm.edu.my/id/eprint/51078/7/1-s2.0-S0012365X96002737-main.pdf http://psasir.upm.edu.my/id/eprint/51078/ http://www.sciencedirect.com/science/article/pii/S0012365X96002737# |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Putra Malaysia |
Language: | English English |
id |
my.upm.eprints.51078 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.510782024-08-08T02:14:40Z http://psasir.upm.edu.my/id/eprint/51078/ Chromatic equivalence classes of certain generalized polygon trees Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. 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). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the equivalence relation '∼'. In this paper, we determine infinitely many chromatic equivalence classes in g under '∼'. As a byproduct, we obtain a family of chromatically unique graphs established by Peng (1995). Elsevier Science 1997 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/51078/1/51078.pdf text en http://psasir.upm.edu.my/id/eprint/51078/7/1-s2.0-S0012365X96002737-main.pdf Peng, Yee Hock and Little, Charles H. C. and Teo, Kee Leong and Wang, H. (1997) Chromatic equivalence classes of certain generalized polygon trees. Discrete Mathematics, 172 (1-3). pp. 103-114. ISSN 0012-365X http://www.sciencedirect.com/science/article/pii/S0012365X96002737# 10.1016/S0012-365X(96)00273-7 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
language |
English English |
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). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the equivalence relation '∼'. In this paper, we determine infinitely many chromatic equivalence classes in g under '∼'. As a byproduct, we obtain a family of chromatically unique graphs established by Peng (1995). |
format |
Article |
author |
Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. |
spellingShingle |
Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. Chromatic equivalence classes of certain generalized polygon trees |
author_facet |
Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. |
author_sort |
Peng, Yee Hock |
title |
Chromatic equivalence classes of certain generalized polygon trees |
title_short |
Chromatic equivalence classes of certain generalized polygon trees |
title_full |
Chromatic equivalence classes of certain generalized polygon trees |
title_fullStr |
Chromatic equivalence classes of certain generalized polygon trees |
title_full_unstemmed |
Chromatic equivalence classes of certain generalized polygon trees |
title_sort |
chromatic equivalence classes of certain generalized polygon trees |
publisher |
Elsevier Science |
publishDate |
1997 |
url |
http://psasir.upm.edu.my/id/eprint/51078/1/51078.pdf http://psasir.upm.edu.my/id/eprint/51078/7/1-s2.0-S0012365X96002737-main.pdf http://psasir.upm.edu.my/id/eprint/51078/ http://www.sciencedirect.com/science/article/pii/S0012365X96002737# |
_version_ |
1807051112742649856 |