Title of article
Chromatically unique 6-bridge graph θ(a; a; a; b; b; c)
Author/Authors
Karim, N.S.A. Universiti Pendidikan Sultan Idris - Faculty of Science and Mathematics - Department of Mathematics, Malaysia , Hasni, R. Universiti Malaysia Terengganu - School of Informatics and Applied Mathematics, Malaysia , Lau, Gee-Choon University Teknologi MARA, Segamat Campus - Faculty of Computer and Mathematical Sciences, Malaysia
From page
60
To page
78
Abstract
For a graph G, let P(G; λ) denote the chromatic polynomial of G. Two graphs G and H arechromatically equivalent if they share the same chromatic polynomial. A graph G is chromaticallyunique if for any graph chromatically equivalent to G is isomorphic to G. In this paper, thechromatically unique of a new family of 6-bridge graph θ(a; a; a; b; b; c) where 2 ≤ a ≤ b ≤ c isinvestigated.
Keywords
chromatic polynomial , chromatically unique , 6 , bridge graph
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2553701
Link To Document