A result on chromatic uniqueness of edge-gluing of graphs
In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial.
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2023
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833410529096368128 |
|---|---|
| author | Chia G.L. Ho C.-K. |
| author2 | 55914572800 |
| author_facet | 55914572800 Chia G.L. Ho C.-K. |
| author_sort | Chia G.L. |
| building | UNITEN Library |
| collection | Institutional Repository |
| content_provider | Universiti Tenaga Nasional |
| content_source | UNITEN Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial. |
| format | Article |
| id | my.uniten.dspace-30885 |
| institution | Universiti Tenaga Nasional |
| publishDate | 2023 |
| record_format | dspace |
| spelling | my.uniten.dspace-308852023-12-29T15:55:16Z A result on chromatic uniqueness of edge-gluing of graphs Chia G.L. Ho C.-K. 55914572800 7404653303 Chromatic polynomials Chromatic uniqueness Complete bipartite graphs Graph theory In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial. Final 2023-12-29T07:55:16Z 2023-12-29T07:55:16Z 2009 Article 2-s2.0-78651554570 https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651554570&partnerID=40&md5=65208e86684aff61b068bf9c98d41708 https://irepository.uniten.edu.my/handle/123456789/30885 70 117 126 Scopus |
| spellingShingle | Chromatic polynomials Chromatic uniqueness Complete bipartite graphs Graph theory Chia G.L. Ho C.-K. A result on chromatic uniqueness of edge-gluing of graphs |
| title | A result on chromatic uniqueness of edge-gluing of graphs |
| title_full | A result on chromatic uniqueness of edge-gluing of graphs |
| title_fullStr | A result on chromatic uniqueness of edge-gluing of graphs |
| title_full_unstemmed | A result on chromatic uniqueness of edge-gluing of graphs |
| title_short | A result on chromatic uniqueness of edge-gluing of graphs |
| title_sort | result on chromatic uniqueness of edge-gluing of graphs |
| topic | Chromatic polynomials Chromatic uniqueness Complete bipartite graphs Graph theory |
| url_provider | http://dspace.uniten.edu.my/ |