On the edge cover polynomial of certain graphs

From MaRDI portal
Publication:4956347



Abstract: Let G be a simple graph of order n and size m. The edge covering of G is a set of edges such that every vertex of G is incident to at least one edge of the set. The edge cover polynomial of G is the polynomial E(G,x)=sumi=ho(G)me(G,i)xi, where e(G,i) is the number of edge coverings of G of size i, and ho(G) is the edge covering number of G. In this paper we study the edge cover polynomials of cubic graphs of order 10. We show that all cubic graphs of order 10 (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 −1 and 0.












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)