𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph extension with constant connectivity

✍ Scribed by Hideshi Ido; Sigeru Omatu

Book ID
106246373
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
353 KB
Volume
10
Category
Article
ISSN
1433-5298

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packing constants in graphs and connecti
Packing constants in graphs and connectivity
✍ Peter Brass πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 82 KB

We prove the following theorem: If G is an r-connected graph and there are k vertices of G which have pairwise distance at least d, then G has at least k(rL(d-1)/2J+l)+ ((1 +(-1)a)/2)r vertices. This bound is sharp. 1. For all bounded metric spaces (M,d) and all k~>2 the packing constant d k is def

Graphs with prescribed connectivity and
Graphs with prescribed connectivity and line graph connectivity
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract Chartrand and Stewart have shown that the line graph of an __n__‐connected graph is itself __n__‐connected. This paper shows that for every pair of integers __m__ > __n__ > 1 there is a graph of point connectivity __n__ whose line graph has point connectivity __m__. The corresponding qu

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 ([$

Graphs with Connected Medians
Graphs with Connected Medians
✍ Bandelt, Hans-JΓΌrgen; Chepoi, Victor πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 174 KB