✦ LIBER ✦

On connectivities of tree graphs

✍ Scribed by Guizhen Liu

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 289 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120318

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

On restricted connectivities of permutat

On restricted connectivities of permutation graphs

✍ C. Balbuena; X. Marcote; P. García-Vázquez 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

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.

Rainbow trees in graphs and generalized

Rainbow trees in graphs and generalized connectivity

✍ Gary Chartrand; Futaba Okamoto; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

The Connectivities of Leaf Graphs of 2-C

The Connectivities of Leaf Graphs of 2-Connected Graphs

✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.