Title

Graphs with not too many spanning trees

Document Type

Article

Publication Date

1-1-1995

Abstract

Let �� be a class of graphs that is closed under taking topological minors. We derive in this paper some necessary and sufficient conditions for the existence of a polynomial p(n) such that t(G) ≤ p(|E(G)|) for all graphs G in ��, where t(G) is the number of spanning trees of G. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company

Publication Source (Journal or Book title)

Networks

First Page

193

Last Page

197

This document is currently not available here.

Share

COinS