On the number of bases of bicircular matroids

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. 

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Gimnez2004OnTN, title={On the number of bases of bicircular matroids}, author={Omer Gim{\'e}nez and Anna de Mier and Marc Noy}, year={2004} }