Mathematics – Combinatorics
Scientific paper
2011-03-11
The Electronic Journal of Combinatorics 19 (2012), #50
Mathematics
Combinatorics
30 pages, 3 figures
Scientific paper
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.
No associations
LandOfFree
The covered components polynomial: A new representation of the edge elimination polynomial does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The covered components polynomial: A new representation of the edge elimination polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The covered components polynomial: A new representation of the edge elimination polynomial will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-430081