Submitted:
16 August 2018
Posted:
17 August 2018
You are already at the latest version
Abstract
For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph Nn, for n ≥ 2 has been determined. It is further shown that N3 is chromatically unique.
Keywords:
chromatic polynomial
; chromatically equivalent
; chromatically unique
; necklace graph
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
