Maximum modulus of independence roots of graphs and trees
From MaRDI portal
Publication:2175814
DOI10.1007/s00373-020-02160-1zbMath1439.05110arXiv1812.09775OpenAlexW3011118259MaRDI QIDQ2175814
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.09775
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the location of roots of independence polynomials
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- On the roots of edge cover polynomials of graphs
- On the location of roots of graph polynomials
- The roots of the independence polynomial of a clawfree graph
- A characterization of well covered graphs of girth 5 or greater
- Roots of independence polynomials of well covered graphs
- On the unimodality of independence polynomials of very well-covered graphs
- On the stability of independence polynomials
- Very well covered graphs
- On the roots of domination polynomials
- On the roots of all-terminal reliability polynomials
- Practical graph isomorphism. II.
- On the roots of independence polynomials of almost all very well-covered graphs
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- The Number of Maximal Independent Sets in a Tree
- A Note on Independent Sets in Trees
- Roots of the Reliability Polynomials
- Chromatic Roots are Dense in the Whole Complex Plane
- Note on the Smallest Root of the Independence Polynomial
- Some covering concepts in graphs
- On cliques in graphs
- The number of maximum independent sets in graphs
This page was built for publication: Maximum modulus of independence roots of graphs and trees
