𝔖 Bobbio Scriptorium
✦   LIBER   ✦

REMARKS ON THE SPHERE OF INFLUENCE GRAPH

✍ Scribed by David Avis; Joe Horton

Book ID
118722232
Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
215 KB
Volume
440
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the variance of the random sphere of
On the variance of the random sphere of influence graph
✍ P. Hitczenko; S. Janson; J. E. Yukich πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of i

Abstract sphere-of-influence graphs
Abstract sphere-of-influence graphs
✍ Frank Harary; Michael S. Jacobson; Marc J. Lipman; F.R. McMorris πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 500 KB
The expected size of the sphere-of-influ
The expected size of the sphere-of-influence graph
✍ Rex A. Dwyer πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 409 KB

The sphere-of-influence graph of a set of point sites in R a is constructed by identifying the nearest neighbor of each site, centering a ball at each site so that its nearest neighbor lies on the boundary, and joining two sites by an edge if and only if their balls intersect. The asymptotic behavio

Remarks on the critical graph conjecture
Remarks on the critical graph conjecture
✍ I. Broere; C.M. Mynhardt πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 344 KB

The vertex-critical graph conjecture (critical graph conjecture respectively) states that every vertex-critical (critical) graph has an odd number of vertices. In this note we prove that if G is a critical graph of even order, then G has at least three vertices of less-than-maximum valency. In addit