ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
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 co...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahrood University of Technology
2015-02-01
|
| Series: | Journal of Algebraic Systems |
| Subjects: | |
| Online Access: | http://jas.shahroodut.ac.ir/article_359_03bd853b0f975a60d986af404d928abd.pdf |