A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)

DOI10.1016/J.DISC.2007.07.030zbMath1225.05136OpenAlexW1505677803MaRDI QIDQ932684

Jianfeng Wang, Chengfu Ye, Ru-Ying Liu, Qiong Xiang Huang

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.030

zbMATH Keywords

adjoint polynomialchromatic equivalence classthe fourth characterthe second smallest real rootthe smallest real root

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On the minimum real roots of the adjoint polynomial of a graph

Cites Work

• The search for chromatically unique graphs
• The search for chromatically unique graphs. II
• Adjoint polynomials and chromatically unique graphs
• Chromaticity of some families of dense graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)