Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)

N.S.A. Karim (Department of Mathematics, Faculty of Science and Mathematics, Universiti Pendidikan Sultan Idris, 35900 Tanjong Malim, Perak, Malaysia)
Roslan Hasni (School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Malaysia)
Gee-Choon Lau (Faculty of Computer and Mathematical Sciences, University Teknologi MARA (Segamat Campus), 85000 Johor, Malaysia)

Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 4, No 1 (2016): Electronic Journal of Graph Theory and Applications

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.