The edge cover polynomials of cubic graphs of order 10

preprint2014arXivOpen access

Abstract

Let GG be a simple graph of order nn and size mm. The edge covering of GG is a set of edges such that every vertex of GG is incident to at least one edge of the set. The edge cover polynomial of GG is the polynomial E(G,x)=∑i=ρ(G)me(G,i)xiE(G,x)=\sum_{i=ρ(G)}^{m} e(G,i) x^{i}, where e(G,i)e(G,i) is the number of edge coverings of GG of size ii, and ρ(G)ρ(G) is the edge covering number of GG. In this paper we study the edge cover polynomials of cubic graphs of order 1010. We show that all cubic graphs of order 1010 (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-1 and 00.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.