Two families of chromatically unique graphs.
Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end...
| Main Author: | |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
1992
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf |
| _version_ | 1825946231214440448 |
|---|---|
| author | Yee, Hock Peng |
| author_facet | Yee, Hock Peng |
| author_sort | Yee, Hock Peng |
| collection | UPM |
| description | Let P(G) denote the chromatic polynomial of a graph G. A graph G
is said to be chromatically unique if P(G) = P(H) implies that H is
isomorphic to G. In this paper, We prove that a graph (resp., a bipartite
graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by
identifying the end vertices of the path Ps with any two vertices of the
complete bipartite graph K2,4 (resp., K3,3) is chromatically unique. |
| first_indexed | 2024-03-06T07:43:48Z |
| format | Conference or Workshop Item |
| id | upm.eprints-18678 |
| institution | Universiti Putra Malaysia |
| language | English English |
| last_indexed | 2024-03-06T07:43:48Z |
| publishDate | 1992 |
| record_format | dspace |
| spelling | upm.eprints-186782014-04-14T06:54:12Z http://psasir.upm.edu.my/id/eprint/18678/ Two families of chromatically unique graphs. Yee, Hock Peng Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end vertices of the path Ps with any two vertices of the complete bipartite graph K2,4 (resp., K3,3) is chromatically unique. 1992 Conference or Workshop Item NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf Yee, Hock Peng (1992) Two families of chromatically unique graphs. In: The Asian Mathematical Conference, 14-18 August 1990, Hong Kong. . Charts, diagrams, etc. Mathematics. English |
| spellingShingle | Charts, diagrams, etc. Mathematics. Yee, Hock Peng Two families of chromatically unique graphs. |
| title | Two families of chromatically unique graphs. |
| title_full | Two families of chromatically unique graphs. |
| title_fullStr | Two families of chromatically unique graphs. |
| title_full_unstemmed | Two families of chromatically unique graphs. |
| title_short | Two families of chromatically unique graphs. |
| title_sort | two families of chromatically unique graphs |
| topic | Charts, diagrams, etc. Mathematics. |
| url | http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf |
| work_keys_str_mv | AT yeehockpeng twofamiliesofchromaticallyuniquegraphs |