Counting spanning trees of multipartite graphs and those containing a fixed spanning forest
Authors:
- Jianxuan LuoJLJianxuan Luo
- Tingzeng WuTWTingzeng Wu
- Yeong-Nan YehYYYeong-Nan Yeh
- 1 September 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 395, 317-336
Abstract
No abstract availableFunding Information
- Natural Science Foundation of Qinghai Province
- National Natural Science Foundation of China (12261071)
- National Natural Science Foundation of China (2025-ZJ-902T)
This publication has 21 references indexed in Scilit:
- A Variant of the Teufl‐Wagner Formula and ApplicationsJournal of Graph Theory, 2025
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forestJournal of Graph Theory, 2023
- Counting spanning trees in almost complete multipartite graphsJournal of Algebraic Combinatorics, 2022
- Counting spanning trees in a complete bipartite graph which contain a given spanning forestJournal of Graph Theory, 2022
- The number of spanning trees of the Bruhat graphAdvances in Applied Mathematics, 2021
- The enumeration of spanning tree of weighted graphsJournal of Algebraic Combinatorics, 2020
- A simple formula for the number of spanning trees of line graphsJournal of Graph Theory, 2017
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected GraphsJournal of Graph Theory, 2016
- Resistance distance in complete -partite graphsDiscrete Applied Mathematics, 2016
- Random walks and the effective resistance sum rulesDiscrete Applied Mathematics, 2010