scholarly journals Undirected simple connected graphs with minimum number of spanning trees

2009 ◽  
Vol 309 (10) ◽  
pp. 3074-3082 ◽  
Author(s):  
Zbigniew R. Bogdanowicz
2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Ş. Burcu Bozkurt ◽  
Durmuş Bozkurt

We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices(n), the number of edges(m), maximum vertex degree(Δ1), minimum vertex degree(δ),…first Zagreb index(M1),and Randić index(R-1).


1994 ◽  
Vol 124 (1-3) ◽  
pp. 241-250
Author(s):  
Preben Dahl Vestergaard

Sign in / Sign up

Export Citation Format

Share Document