The covered components polynomial: a new representation of the edge elimination polynomial
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a recurrence relation, which shows that both graph polynomials are substitution instances of each other. We give some properties of the covered components polynomial and some results concerning relations to other graph polynomials.
DOI :
10.37236/2072
Classification :
05C30, 05C31
Mots-clés : recurrence relation, spanning subgraphs, covered components polynomial, edge elimination polynomial
Mots-clés : recurrence relation, spanning subgraphs, covered components polynomial, edge elimination polynomial
@article{10_37236_2072,
author = {Martin Trinks},
title = {The covered components polynomial: a new representation of the edge elimination polynomial},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {1},
doi = {10.37236/2072},
zbl = {1243.05114},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2072/}
}
Martin Trinks. The covered components polynomial: a new representation of the edge elimination polynomial. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/2072
Cité par Sources :