Premium
Graphs with not too many spanning trees
Author(s) -
Ding Guoli
Publication year - 1995
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230250405
Subject(s) - spanning tree , combinatorics , mathematics , class (philosophy) , discrete mathematics , computer science , artificial intelligence
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 .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom