𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connectivities of finite and infinite graphs

✍ Scribed by H. A. Jung; M. E. Watkins

Publisher
Springer Vienna
Year
1977
Tongue
English
Weight
507 KB
Volume
83
Category
Article
ISSN
0026-9255

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 line and total gra
The connectivities of line and total graphs
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 371 KB πŸ‘ 1 views

## Abstract Sharp lower bounds for the point connectivity and line connectivity of the line graph __L(G__) and the total graph __T(G__) of a graph __G__ are determined. The lower bounds are expressed in terms of the point connectivity __k__, line connectivity Ξ», and minimum degree Ξ΄ of __G.__ It is

On finite fixed sets in infinite graphs
On finite fixed sets in infinite graphs
✍ H.A. Jung πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 762 KB

## An automorphism of a graph X is called a translation of X if it fixes no finite non-empty set of vertices of X. It is shown that a group G of automorphisms of the connected graph X fixes a finite non-empty set of vertices or ends of X if and only if any two translations of X in G have a common