Zeros of graph-counting polynomials
From MaRDI portal
Recommendations
Cited in
(16)- Graph compression and the zeros of polynomials
- scientific article; zbMATH DE number 3924831 (Why is no real title available?)
- Some applications of Wagner's weighted subgraph counting polynomial
- Graph-counting polynomials for oriented graphs
- Weighted enumeration of spanning subgraphs with degree constraints
- The planar limit of \(\mathcal{N} = 2\) superconformal quiver theories
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- Zero-freeness and approximation of real Boolean Holant problems
- Counting faces of graphical zonotopes
- Relations and bounds for the zeros of graph polynomials using vertex orbits
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems
- Approximating real-rooted and stable polynomials, with combinatorial applications
- Polynomials counting nowhere-zero chains in graphs
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
- About David Ruelle, after his 80th birthday
This page was built for publication: Zeros of graph-counting polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284085)