Enumeration for the total number of all spanning forests of complete tripartite graph based on the combinatorial decomposition
U, Sung Sik
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.