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

The Maximum Connectivity of a Graph

โœ Scribed by Frank Harary

Book ID
123657263
Publisher
National Academy of Sciences
Year
1962
Tongue
English
Weight
215 KB
Volume
48
Category
Article
ISSN
0027-8424

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the maximum induced forests of a conn
On the maximum induced forests of a connected cubic graph without triangles
โœ Maolin Zheng; Xiaoyun Lu ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
โœ Y. Caro; I. Krasikov; Y. Roditty ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB ๐Ÿ‘ 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__ฮด(__G__) + 1, where ฮด(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als