1. ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS

S. Alikhani; S. Jahari

Volume 2, Issue 2 , Winter and Spring 2015, , Pages 97-108

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)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$, where $e(G,i)$ is the number of edge coverings ...  Read More