𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Family of Graphs with Minimum Number of Spanning Trees

✍ Scribed by Zbigniew R. Bogdanowicz

Book ID
120788770
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
152 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs with the maximum number of spa
On graphs with the maximum number of spanning trees
✍ 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

Two-cacti with minimum number of spannin
Two-cacti with minimum number of spanning trees
✍ Preben Dahl Vestergaard πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 624 KB

proved that the spanning trees of a 2-cactus partition into at least 3 isomorphism classes. Here we examine the structure of these 2-cacti for which the spanning trees partition into exactly 3 isomorphism classes.

On the characterization of graphs with m
On the characterization of graphs with maximum number of spanning trees
✍ L. Petingi; F. Boesch; C. Suffel πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 591 KB

A graph G with n nodes and e edges is said to be t-optimal if G has the maximum number of spanning trees among all graphs with the same number of nodes and edges as G. Hitherto, t-optimal graphs have been characterized for the following cases: (a) n=sp, and e=(s(s-1)/2)p 2, when s and p are positive