Abstract

AbstractMoon's classical result implies that the number of spanning trees of a complete graph with vertices containing a given spanning forest equals , where is the number of components of , and are the numbers of vertices of component of . Dong and Ge extended this result to the complete bipartite graph, and obtain an interesting formula to count spanning trees of a complete bipartite graph containing a given spanning forest . They also posed the problem to count spanning trees of a complete ‐partite graph containing a given spanning forest for . In this paper, we propose a technique to solve this problem. Using this technique, we obtain closed formulae to count spanning trees of complete ‐partite graphs containing a given spanning forest for and 4. Our technique also results in a new and simple proof of Dong and Ge's formula.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.