Abstract
The multiple complete split-like graph MCSb,sa is the join of an empty graph K‾a and s copies of complete graph Kb. In this article, we obtain the formulas for the number of spanning trees of MCSb,sa containing a given spanning forest when s=1 and 2. Particularly, when s=1, our result derives the number of spanning trees of complete split graph containing a given spanning forest, thereby extending Moon's result [19].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.