On the roots of expected independence polynomials
From MaRDI portal
Publication:5325944
DOI10.1002/JGT.21678zbMATH Open1269.05087OpenAlexW1600957744MaRDI QIDQ5325944FDOQ5325944
Authors: Karl Dilcher, Dante V. Manna, Jason I. Brown
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21678
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (16)
- Sums of random polynomials with independent roots
- On a sequence of sparse binomial-type polynomials
- Co-2-plex polynomials
- Some applications of Wagner's weighted subgraph counting polynomial
- Independence polynomials of bipartite graphs
- On the stability of independence polynomials
- On a conjecture of Sokal concerning roots of the independence polynomial
- On the coefficients of the independence polynomial of graphs
- Some properties of a class of sparse polynomials
- Average independence polynomials
- Dependence polynomials
- On a conjecture on sparse binomial-type polynomials by Brown, Dilcher and Manna
- Bounding the roots of independence polynomials.
- Divisibility and arithmetic properties of a class of sparse polynomials
- Estimates of the probability of coincidence of outcome frequency vectors in independent polynomial schemes
- Title not available (Why is that?)
This page was built for publication: On the roots of expected independence polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325944)