A complete solution to the chromatic equivalence class of graph B_n-7,1,3

DOI10.1016/J.DISC.2007.07.030MaRDI QIDQ932684zbMATH OpenOpenAlexFDO

Authors Jianfeng Wang, Chengfu Ye, Ru Ying Liu, Qiongxiang 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

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

Recommendations

• The chromatic equivalence class of graph B_n-6,12
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\)
• The chromatic equivalence class of graph _n^3(n-3,1).
• The fifth coefficient of adjoint polynomial and a new invariant.

Cites work

• Adjoint polynomials and chromatically unique graphs
• Chromatic uniqueness of a class of graphs
• Chromaticity of some families of dense graphs
• Graph theory
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 5190666 (Why is no real title available?)
• scientific article; zbMATH DE number 4091530 (Why is no real title available?)
• scientific article; zbMATH DE number 1214963 (Why is no real title available?)
• scientific article; zbMATH DE number 1744094 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• The graph parameter (G) and the classification of graphs according to Itô
• The search for chromatically unique graphs
• The search for chromatically unique graphs. II

Cited in

(5)

• On the minimum real roots of the adjoint polynomial of a graph
• A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\)
• The chromatic equivalence class of graph _n^3(n-3,1).
• The chromatic equivalence class of graph B_n-6,12
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932684)