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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.