A complete solution to the chromatic equivalence class of graph (Bn-7,1,3)over-bar

作者：Wang Jianfeng^*; Liu Ruying; Ye Chengfu; Huang Qiongxiang

来源：Discrete Mathematics, 2008, 308(16): 3607-3623.

DOI：10.1016/j.disc.2007.07.030

• adjoint polynomial
• the smallest real root
• the second smallest real root
• the fourth character
• chromatic equivalence class

By h(G, x) and P(G, lambda)we denote the adjoint polynomial and the chromatic polynomial of a graph G, respectively. Anew invariant of graph G, which is the fourth character R-4(G), is given. By the properties of the adjoint polynomials, the adjoint equivalence class of graph B-n-7,B-1,B-3 is determined. According to the relations between h(G, x) and P(G, lambda), we also simultaneously determine the chromatic equivalence class of (B-n-7,B-1,B-3) over bar which is the complement of B-n-7,B-1,B-3.

• 出版日期2008-8-28
• 单位新疆大学; 青海师范大学