A Family of Chromatically Unique 6-bridge Graphs

作者：Khalaf A M^*; Peng Y H

来源：Ars Combinatoria, 2010, 94: 211-220.

• Chromatic polynomials
• Chromaticity
• 6-bridge graphs

Let P(G, lambda) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G similar to H, if P(G, lambda) = P(H, lambda). A graph G is chromatically unique written chi-unique, if for any graph H, G similar to H implies that G is isomorphic with H. In this paper we prove that the graph theta(a(1), a(2), ..., a(6)) is chi-unique for exactly two distinct values of a(1), a(2), ..., a(6).

• 出版日期2010-1