On the upper bound for the number of spanning trees of a connected graph
From MaRDI portal
Publication:2809949
zbMATH Open1342.05024MaRDI QIDQ2809949
Publication date: 30 May 2016
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Related Items (3)
Upper bounds for the number of spanning trees of graphs ⋮ On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs ⋮ Title not available (Why is that?)
This page was built for publication: On the upper bound for the number of spanning trees of a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809949)
