Abstract
Let t(G) be the number of spanning trees of a connected graph G, and let b(G) be the number of bases of the bicircular matroid B(G). In this paper we obtain bounds relating b(G) and t(G), and study in detail the case where G is a complete graph Kn or a complete bipartite graph Kn,m.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have