๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the number of spanning trees of some irregular line graphs

โœ Scribed by Yan, Weigen

Book ID
120497793
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
247 KB
Volume
120
Category
Article
ISSN
0097-3165

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

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