The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial
Keyword(s):
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.
Keyword(s):
2010 ◽
Vol 20
(2)
◽
pp. 299-320
◽
Keyword(s):
2009 ◽
Vol 18
(4)
◽
pp. 601-615
◽
1970 ◽
Vol 24
◽
pp. 72-78
2020 ◽
Vol 23
(4)
◽
pp. 142-150
Keyword(s):
1965 ◽
Vol 5
(2)
◽
pp. 207-215
Keyword(s):