Enumeration for the total number of all spanning forests of complete tripartite graph based on the combinatorial decomposition
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.
math.CO↗