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

DOI10.1016/j.disc.2009.01.015zbMath1188.05078OpenAlexW2082600429MaRDI QIDQ1044000

Ru-Ying Liu, Hai-xing Zhao

Publication date: 10 December 2009

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

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

zbMATH Keywords

graphadjoint polynomial\(\sigma \)-polynomialminimum real root

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Real and complex fields (12D99)

Related Items (3)

One more remark on the adjoint polynomial ⋮ Two remarks on the adjoint polynomial ⋮ On the Roots of σ-Polynomials

Cites Work

• The chromaticity of certain complete multipartite graphs
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
• A new method for proving chromatic uniqueness of graphs
• Adjoint polynomials and chromatically unique graphs
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• \(\sigma\)-polynomials and graph coloring
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• Expansions of Chromatic Polynomials and Log-Concavity
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• The largest eigenvalue of a graph: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum real roots of the adjoint polynomial of a graph