Maximizing the Number of Spanning Trees in a Connected Graph
From MaRDI portal
Publication:5211668
DOI10.1109/TIT.2019.2940263zbMath1437.05047arXiv1804.02785OpenAlexW2973125465MaRDI QIDQ5211668
Zhong-Zhi Zhang, Yuhao Yi, Stacy Patterson, Hu-An Li
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02785
Related Items (4)
Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal ⋮ Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition ⋮ COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB ⋮ Unnamed Item
This page was built for publication: Maximizing the Number of Spanning Trees in a Connected Graph
