The following pages link to (Q3043192):
Displaying 29 items.
- Independence polynomials of bipartite graphs (Q2091140) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
- Graphs whose independence fractals are line segments (Q2227937) (← links)
- Independent vertex sets in the Zykov sum (Q2243144) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- The behavior of Tutte polynomials of graphs under five graph operations and its applications (Q2286158) (← links)
- Bipartition polynomials, the Ising model, and domination in graphs (Q2344022) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← 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)
- A note on the values of independence polynomials at \(-1\) (Q2629283) (← links)
- On the zeros of the partial Hosoya polynomial of graphs (Q2663563) (← links)
- Unimodality of independence polynomials of the cycle cover product of graphs (Q2671547) (← links)
- Exponential Time Complexity of Weighted Counting of Independent Sets (Q3058702) (← links)
- INDEPENDENCE AND PI POLYNOMIALS FOR FEW STRINGS (Q3388619) (← links)
- The Merrifield–Simmons Conjecture Holds for Bipartite Graphs (Q4916104) (← links)
- Vector weighted Stirling numbers and an application in graph theory (Q4958064) (← links)
- Unimodality of independence polynomials of rooted products of graphs (Q4965364) (← links)
- Unimodality of the independence polynomials of some composite graphs (Q5005855) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs (Q5080284) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- (Q5137479) (← links)
- Independence Equivalence Classes of Paths and Cycles (Q5206913) (← links)
- (Q5241134) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)
- The independent set sequence of some families of trees (Q5374238) (← links)
- On real-rootedness of independence polynomials of rooted products of graphs (Q6089355) (← links)
