Pages that link to "Item:Q691586"

The following pages link to On the edge cover polynomial of a graph (Q691586):

Displaying 21 items.

• Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
• On the roots of edge cover polynomials of graphs (Q648996) (← links)
• On the location of roots of graph polynomials (Q740260) (← links)
• Some results on the independence polynomial of unicyclic graphs (Q1708399) (← links)
• The zero forcing polynomial of a graph (Q1732095) (← links)
• On a poset of trees revisited (Q2020047) (← links)
• Chromatic symmetric function of graphs from Borcherds algebras (Q2040502) (← links)
• On the unimodality of average edge cover polynomials (Q2113363) (← links)
• On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs (Q2196156) (← links)
• Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences (Q2248725) (← links)
• The universal edge elimination polynomial and the dichromatic polynomial (Q2857322) (← links)
• (Q3369845) (← links)
• Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials (Q3457541) (← links)
• ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS (Q4956347) (← links)
• The average domination polynomial of graphs is unimodal (Q5051450) (← links)
• CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS (Q5055038) (← links)
• On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs (Q5080284) (← links)
• A Most General Edge Elimination Polynomial (Q5302041) (← links)
• On the number of irreducible covers of a graph by edges (Q5650415) (← links)
• On the non-commuting graph of the group \(U_{6n}\) (Q6618032) (← links)