On the connectivity of total graphs
β Scribed by Takashi Hamada; Toshio Nonaka; Izumi Yoshimura
- Publisher
- Springer
- Year
- 1972
- Tongue
- English
- Weight
- 360 KB
- Volume
- 196
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
The local connectivity ΞΊ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let Ξ΄(G) be the minimum degree of G. We call a graph G maximally connected when ΞΊ(G) = Ξ΄