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

Graph construction with the maximum number of trees by continuous edge addition

โœ Scribed by Hideshi Ido; Yosuke Ohama; Tomoki Takahashi

Book ID
106246372
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
339 KB
Volume
10
Category
Article
ISSN
1433-5298

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Finding the Graph with the Maximum Numbe
Finding the Graph with the Maximum Number of Spanning Trees
โœ 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 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

The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
โœ R.J. Faudree; J. Sheehan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

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