On the edge cover polynomial of certain graphs
From MaRDI portal
Publication:4956347
Abstract: Let be a simple graph of order and size . The edge covering of is a set of edges such that every vertex of is incident to at least one edge of the set. The edge cover polynomial of is the polynomial , where is the number of edge coverings of of size , and is the edge covering number of . In this paper we study the edge cover polynomials of cubic graphs of order . We show that all cubic graphs of order (especially the Petersen graph) are determined uniquely by their edge cover polynomials. Also we construct infinite families of graphs whose edge cover polynomials have only roots and .
Recommendations
Cites work
Cited in
(12)- On the unimodality of average edge cover polynomials
- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
- Domination polynomials of cubic graphs of order 10
- scientific article; zbMATH DE number 5003360 (Why is no real title available?)
- scientific article; zbMATH DE number 29609 (Why is no real title available?)
- On the characteristic polynomials of covering number of vertices and edges of graphs
- scientific article; zbMATH DE number 5202624 (Why is no real title available?)
- On the number of irreducible covers of a graph by edges
- Domination Polynomials of certain hexagon lattice graphs
- Edge covers of caterpillars, cycles with pendants, and spider graphs
- On the roots of edge cover polynomials of graphs
- On the edge cover polynomial of a graph
This page was built for publication: On the edge cover polynomial of certain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956347)