Malaysian Journal of Mathematical Sciences, March 2016, Vol. 10(S)
Special Issue: The 10th IMT-GT International Conference on Mathematics, Statistics and its Applications 2014 (ICMSA 2014)
Chromaticity of 6-bridge Graph $\theta (3, 3, b, b, c, c)$
Nor Suriya Abd Karim and Roslan Hasni
Corresponding Email: [email protected]
Received date: -
Accepted date: -
Abstract:
For a graph $G$, let $P(G, \lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent (or simply $\chi$-equivalent), denoted by $G\sim H$, if $P(G, \lambda) = P(H, \lambda)$. A graph $G$ is chromatically unique (or simply $\chi$-unique) if for any graph $H$ such that $H \sim G$, we have $H\cong G$, that is, $H$ is isomorphic to $G$. In this paper, the chromatic uniqueness of a family of 6-bridge graph is determined.
Keywords: Chromatic polynomial, chromatically unique, 6-bridge graph
