𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected graphs with a minimal number of spanning trees

✍ Scribed by N Gaffke


Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
743 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On graphs with the maximum number of spa
✍ Alexander K. Kelmans πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

Finding the Graph with the Maximum Numbe
✍ George Moustakides; Samuel D. Bedrosian πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 328 KB

The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N, B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or

On the number of spanning trees in a mol
✍ R.B. Mallion πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.