The following pages link to (Q2716005):
Displayed 20 items.
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs (Q412167) (← links)
- A way to construct independence equivalent graphs (Q452914) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- On the roots of Wiener polynomials of graphs (Q724845) (← links)
- Building graphs whose independence polynomials have only real roots (Q844224) (← links)
- On the dependence polynomial of a graph (Q854836) (← links)
- The roots of the independence polynomial of a clawfree graph (Q875937) (← links)
- The independence polynomial of rooted products of graphs (Q968175) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- The independence fractal of a graph. (Q1405113) (← links)
- Average independence polynomials (Q1767674) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- A note on purely imaginary independence roots (Q2005699) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- Generalizations of the matching polynomial to the multivariate independence polynomial (Q2328133) (← links)
- Graphs, partitions and Fibonacci numbers (Q2370416) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture (Q2493111) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)