On the edge cover polynomial of a graph
From MaRDI portal
Publication:691586
DOI10.1016/J.EJC.2012.05.005zbMATH Open1254.05077OpenAlexW1968052199MaRDI QIDQ691586FDOQ691586
Authors: S. Akbari, Mohammad Reza Oboudi 
Publication date: 3 December 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.05.005
Recommendations
- On the roots of edge cover polynomials of graphs
- On the edge cover polynomial of certain graphs
- On the unimodality of average edge cover polynomials
- scientific article; zbMATH DE number 2108128
- On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (28)
- INDUCED CYCLE POLYNOMIAL OF A GRAPH
- The average domination polynomial of graphs is unimodal
- The zero forcing polynomial of a graph
- On the unimodality of average edge cover polynomials
- Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials
- On the roots of edge cover polynomials of graphs
- Some applications of Wagner's weighted subgraph counting polynomial
- On the characteristic polynomials of covering number of vertices and edges of graphs
- On the edge cover polynomial of certain graphs
- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
- A Most General Edge Elimination Polynomial
- POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS
- Chromatic symmetric function of graphs from Borcherds algebras
- On a poset of trees revisited
- On the number of irreducible covers of a graph by edges
- On the non-commuting graph of the group \(U_{6n}\)
- Graphs whose certain polynomials have few distinct roots
- ON STAR POLYNOMIAL OF A VERTEX WEIGHTED CYCLE GRAPH AND ALSO OF A DIFFERENCE GRAPH
- Title not available (Why is that?)
- Edge covers of caterpillars, cycles with pendants, and spider graphs
- Some results on the independence polynomial of unicyclic graphs
- The covered components polynomial: a new representation of the edge elimination polynomial
- The universal edge elimination polynomial and the dichromatic polynomial
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
- On the location of roots of graph polynomials
- Domination polynomial of the rook graph
- CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs
This page was built for publication: On the edge cover polynomial of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691586)
