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: | Chia G.L., Ho C.-K. |
---|---|
其他作者: | 55914572800 |
格式: | Article |
出版: |
2023
|
主题: | |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Chromatic equivalence classes of complete tripartite graphs
由: Chia G.L., et al.
出版: (2023) -
On eccentric graphs of unique eccentric point graphs and diameter maximal graphs
由: Sriram, S., et al.
出版: (2015) -
G-angulability of convex geometric graphs
由: al-Hakeem, Niran Abbas Ali
出版: (2018) -
Commuting graph of some prime order elements in symplectic and mathieu groups
由: Mohd Kasim, Suzila
出版: (2020) -
Computation of three topological indices on some molecular graphs and families of nanostar dendrimers
由: Haoer, Raad Sehen
出版: (2018)