Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
| Autor: | N.S.A. Karim, Roslan Hasni, Gee-Choon Lau |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | Electronic Journal of Graph Theory and Applications, Vol 4, Iss 1, Pp 60-78 (2016) |
| Druh dokumentu: | article |
| ISSN: | 2338-2287 |
| DOI: | 10.5614/ejgta.2016.4.1.6 |
| Popis: | For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if for any graph chromatically equivalent to $G$ is isomorphic to $G$. In this paper, the chromatically unique of a new family of 6-bridge graph $\theta(a,a,a,b,b,c)$ where $2\le a\le b\le c$ is investigated. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|