On the roots of -polynomials

DOI10.1002/JGT.21889MaRDI QIDQ2811197zbMATH OpenOpenAlexFDO

Authors Aysel Erey, Jason I. Brown

Publication date 10 June 2016

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.21889

zbMATH Keywords

chromatic numberchromatic polynomial\(\sigma\)-polynomialreal rootscompatible polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the real roots of \(\sigma\)-polynomials
• \(\sigma\)-polynomials and graph coloring
• The roots of -polynomials
• On graphs having -polynomials of the same degree
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs

Cites work

• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 927084 (Why is no real title available?)
• scientific article; zbMATH DE number 2188422 (Why is no real title available?)
• A note on coefficients of chromatic polynomials
• A note on the real part of complex chromatic roots
• Adjoint polynomials and chromatically unique graphs
• Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials
• An introduction to chromatic polynomials
• Bell and Stirling numbers for graphs
• Characterization of quadratic and cubic \(\sigma\)-polynomials
• Chromaticity of the complements of paths and cycles
• Concavity properties and a generating function for stirling numbers
• Expansions of Chromatic Polynomials and Log-Concavity
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• Maximal σ‐polynomials of connected 3‐chromatic graphs
• On graphs having -polynomials of the same degree
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• On the minimum real roots of the adjoint polynomial of a graph
• Rook theory. III: Rook polynomials and the chromatic structure of graphs
• Stirling Behavior is Asymptotically Normal
• Stirling numbers of forests and cycles
• The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4
• The partition polynomial of a finite set system
• The roots of the independence polynomial of a clawfree graph
• Theory of monomer-dimer systems
• Two remarks on the adjoint polynomial
• \(\sigma\)-polynomials
• \(\sigma\)-polynomials and graph coloring

Cited in

(18)

• scientific article; zbMATH DE number 5067963 (Why is no real title available?)
• The \(\sigma\)-polynomials of unlabeled graphs
• \(\sigma\)-polynomials
• scientific article; zbMATH DE number 599309 (Why is no real title available?)
• A supplementary bibliography: on roots of polynomials
• On the structure of polynomial roots
• On the roots of Hosoya polynomial
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• scientific article; zbMATH DE number 927084 (Why is no real title available?)
• Roots of unity and the polynomials with coefficients in \(\mathbb{T}\)
• On the real roots of \(\sigma\)-polynomials
• ON THE ROOTS OF HUB POLYNOMIALS
• scientific article; zbMATH DE number 892073 (Why is no real title available?)
• On roots of \(a^ kb^{\ell}\)
• A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs
• On graphs having -polynomials of the same degree
• The roots of -polynomials
• On \(\sigma\)-polynomials and a class of chromatically unique graphs

This page was built for publication: On the roots of \(\sigma\)-polynomials

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