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

Spanningk-Trees ofn-Connected Graphs

โœ Scribed by Mikio Kano; Hiroo Kishimoto

Book ID
106047956
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
221 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Matching extension in the powers ofn-con
Matching extension in the powers ofn-connected graphs
โœ Walcher, Kara Lee ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 288 KB ๐Ÿ‘ 1 views

Let G be a graph on p vertices. Then for a positive integer n, G is said to be n-extendible if (i) TI < p / 2 , iii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is TIconnected, then Gk is ([$

Permutation graphs: Connected domination
Permutation graphs: Connected domination and Steiner trees
โœ Charles J. Colbourn; Lorna K. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

Connectivity keeping trees in k-connecte
Connectivity keeping trees in k-connected graphs
โœ W. Mader ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 86 KB

We show that one can choose the minimum degree of a k-connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G -V (T ) remains k-connected.

On connectivities of tree graphs
On connectivities of tree graphs
โœ Guizhen Liu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 289 KB

Let T(G) be the tree graph of a graph G with cycle rank r. Then K ( T ( G ) ) 3 m ( G ) -r, where K(T(G)) and m(G) denote the connectivity of T ( G ) and the length of a minimum cycle basis for G, respectively. Moreover, the lower bound of m ( G ) -r is best possible.