✦ LIBER ✦

On thel-connectivity of a graph

✍ Scribed by Ortrud R. Oellermann

Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 363 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788551

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-leaf connectivity of a random graph

✍ Thomasz Luczak 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

On the edge-connectivity vector of a gra

On the edge-connectivity vector of a graph

✍ Linda M. Lesniak; Raymond E. Pippert 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

Bounds on the average connectivity of a

Bounds on the average connectivity of a graph

✍ Peter Dankelmann; Ortrud R. Oellermann 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we consider the concept of the average connectivity of a graph, deÿned to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. We establish sharp bounds for this parameter in terms of the average degree and improve o

Local connectivity of a random graph

✍ P. Erdös; E. M. Palmer; R. W. Robinson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract A graph is locally connected if for each vertex ν of degree __≧2__, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

The rainbow connectivity of a graph

✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

On k-connectivity for a geometric random

On k-connectivity for a geometric random graph

✍ Mathew D. Penrose 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## Ž . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected Ž . w x respectively, has minimum degree k