Pages that link to "Item:Q648996"
From MaRDI portal
The following pages link to On the roots of edge cover polynomials of graphs (Q648996):
Displaying 15 items.
- On the roots of domination polynomial of graphs (Q266947) (← links)
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- Some results on the independence polynomial of unicyclic graphs (Q1708399) (← links)
- Chromatic symmetric function of graphs from Borcherds algebras (Q2040502) (← links)
- On the unimodality of average edge cover polynomials (Q2113363) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- On a Poset of Trees II (Q2852613) (← links)
- The average domination polynomial of graphs is unimodal (Q5051450) (← links)
