arXiv Analytics

Sign in

arXiv:1311.0706 [math.CO]AbstractReferencesReviewsResources

Enumeration for the total number of all spanning forests of complete tripartite graph based on the combinatorial decomposition

Sung Sik U

Published 2013-11-04, updated 2014-03-25Version 2

This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.

Comments: 6 pages
Categories: math.CO
Subjects: 05C05, 05C17, 05C30
Related articles: Most relevant | Search more
arXiv:1208.5993 [math.CO] (Published 2012-08-29, updated 2012-12-12)
Γ-species and the enumeration of k-trees
arXiv:math/0609475 [math.CO] (Published 2006-09-17)
Enumeration of subtrees of trees
arXiv:0705.0042 [math.CO] (Published 2007-05-01, updated 2009-11-10)
Enumeration of Point-Determining Graphs

Links

Toolbox