On the roots of -polynomials

DOI10.1002/JGT.21889zbMATH Open1339.05113OpenAlexW1883961587MaRDI QIDQ2811197FDOQ2811197

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

Recommendations

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Title not available (Why is that?)
• The \(\sigma\)-polynomials of unlabeled graphs
• \(\sigma\)-polynomials
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Roots of unity and the polynomials with coefficients in \(\mathbb{T}\)
• ON THE ROOTS OF HUB POLYNOMIALS
• Title not available (Why is that?)
• On the real roots of \(\sigma\)-polynomials
• On roots of \(a^ kb^{\ell}\)
• A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs
• On graphs having \(\sigma\)-polynomials of the same degree
• The roots of \(\sigma\)-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)