Two remarks on the adjoint polynomial
From MaRDI portal
Publication:412253
DOI10.1016/j.ejc.2011.11.010zbMath1244.05119OpenAlexW2011800601MaRDI QIDQ412253
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.11.010
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
One more remark on the adjoint polynomial ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ Bipartite graphs as polynomials and polynomials as bipartite graphs ⋮ On the Roots of σ-Polynomials
Cites Work
- Unnamed Item
- Matching polynomials and duality
- On the minimum real roots of the adjoint polynomial of a graph
- Problems in algebraic combinatorics
- The roots of \(\sigma\)-polynomials
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- Theory of monomer-dimer systems
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
- On the theory of the matching polynomial
- Expansions of Chromatic Polynomials and Log-Concavity
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- Note on the Smallest Root of the Independence Polynomial
- An introduction to chromatic polynomials
This page was built for publication: Two remarks on the adjoint polynomial