Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Bozkurt, S.B.: Upper bounds for the number of spanning trees of graphs. J. Inequal. Appl. 2012, 269 (2012)
2. Cheng, C.-S.: Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory. J. Combin. Theory Ser. B 31, 240–248 (1981)
3. Chung, F.: Spectral Graph Theory. CBMS, USA (1997)
4. Chung, F.: Discrete isoperimetric inequalities. Surveys in Differential Geometry IX, International Press 9, 53–82 (2004)
5. Das, K.C.: A sharp upper bounds for the number of spanning trees of a graph. Graphs Combin. 23, 625–632 (2007)