✦ LIBER ✦

The connectivity of a graph on uniform points on [0,1]d

✍ Scribed by Martin J.B. Appel; Ralph P. Russo

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 183 KB
Volume: 60
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(02)00233-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the points of the D field D1,0

✍ Ya. I. Shtipel'man 📂 Article 📅 1970 🏛 Springer US 🌐 English ⚖ 235 KB

On thel-connectivity of a graph

✍ Ortrud R. Oellermann 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 363 KB

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

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

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 (