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

The connectivities of adjacent tree graphs

โœ Scribed by Guizhen Liu

Book ID
112666689
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1987
Tongue
English
Weight
401 KB
Volume
3
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

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.

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.

Spanningk-Trees ofn-Connected Graphs
Spanningk-Trees ofn-Connected Graphs
โœ Mikio Kano; Hiroo Kishimoto ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 221 KB
The ordering of trees and connected grap
The ordering of trees and connected graphs by algebraic connectivity
โœ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with ฮฑ(P n ) < ฮฑ(Q n ) < ฮฑ(W n ) < ฮฑ(Z n ) < ฮฑ(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L