The covered components polynomial: a new representation of the edge elimination polynomial (Q426819)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The covered components polynomial: a new representation of the edge elimination polynomial |
scientific article |
Statements
The covered components polynomial: a new representation of the edge elimination polynomial (English)
0 references
12 June 2012
0 references
Summary: 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.
0 references
recurrence relation
0 references
spanning subgraphs
0 references
covered components polynomial
0 references
edge elimination polynomial
0 references