On bipartite graphs with the minimum number of spanning trees
Authors:
- Shicai GongSGShicai Gong
- Yue XuYXYue Xu
- Peng ZouPZPeng Zou
- Jiaxin WangJWJiaxin Wang
- 4 April 2025
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (7)
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12271484)
This publication has 23 references indexed in Scilit:
- Graphs with the fewest matchingsCombinatorica, 2015
- Nonexistence of optimal graphs for all terminal reliabilityNetworks, 2013
- On Family of Graphs with Minimum Number of Spanning TreesGraphs and Combinatorics, 2012
- Enumerative Properties of Ferrers GraphsDiscrete & Computational Geometry, 2004
- On graphs with the maximum number of spanning treesRandom Structures & Algorithms, 1996
- A proof of Boesch's conjectureNetworks, 1994
- A reliability‐improving graph transformation with applications to network reliabilityNetworks, 1992
- On graphs with randomly deleted edgesActa Mathematica Hungarica, 1981
- Graphs with an extremal number of spanning treesJournal of Graph Theory, 1980
- A certain polynomial of a graph and graphs with an extremal number of treesJournal of Combinatorial Theory, Series B, 1974