Zeros of graph-counting polynomials

DOI10.1007/S002200050522zbMATH Open0917.05074OpenAlexW2004919109MaRDI QIDQ1284085FDOQ1284085

David Ruelle

Publication date: 11 August 1999

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002200050522

zbMATH Keywords

symmetric polynomialslocation of zerosgraph-counting polynomials

Mathematics Subject Classification ID

Graph theory (05C99)

Cited In (13)

• Graph compression and the zeros of polynomials
• Title not available (Why is that?)
• 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
• Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems
• From a zoo to a zoology: Towards a general theory of graph polynomials
• 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

   Recommendations

• Graph-counting polynomials for oriented graphs 👍 👎
• Location of Zeros of Chromatic and Related Polynomials of Graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Counting unbranched subgraphs 👍 👎
• Title not available (Why is that?) 👍 👎

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)