The chromaticity of a family of 6-bridge graph
Nor Suriya Abd Karim, Roslan Hasni · Journal of Physics Conference Series · 2017
For such a graph G , suppose P ( G , λ) denote the chromatic polynomial of graph G . Let G and H are two graphs, then G and H are said to be chromatically equivalent (or simply χ - equivalent) denoted by G ∼ H , if P ( G , λ) = P ( H , λ). A graph G is said to be chromatically unique (or simply χ -unique) if for any graph H such that G ∼ H , we have G ≅ H , that is G is isomorphic to H . In this paper, the chromaticity of a family of 6-bridge graph, that is θ ( a,a,b,b,c,c ) is investigated. The result is presented in Theorem 3.1 in Section 3 of this paper.