✦ LIBER ✦

The expected size of some graphs in computational geometry

✍ Scribed by L. Devroye

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 658 KB
Volume: 15
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(88)90071-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Applications of Some Properties of the C

Applications of Some Properties of the Canonical Module in Computational Projective Algebraic Geometry

✍ Marc Chardin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 308 KB

We here develop some new algorithms for computing several invariants attached to a projective scheme (dimension, Hilbert polynomial, unmixed part,... ) that are based on liaison theory and therefore connected to properties of the canonical module. The main features of these algorithms are their simp

The geometry of t-spreads in k-walk-regu

The geometry of t-spreads in k-walk-regular graphs

✍ C. Dalfó; M. A. Fiol; E. Garriga 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 1 views

## Abstract A graph is walk‐regular if the number of closed walks of length ℓ rooted at a given vertex is a constant through all the vertices for all ℓ. For a walk‐regular graph __G__ with __d__+1 different eigenvalues and spectrally maximum diameter __D__=__d__, we study the geometry of its __d__‐

The size of the largest hole in a random

The size of the largest hole in a random graph

✍ Tomasz Łuczak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning

Defining numbers in some of the Harary g

Defining numbers in some of the Harary graphs

✍ D.A. Mojdeh; A.P. Kazemi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 376 KB

## Defining set The defining number The strong defining number Harary graph a b s t r a c t In a given graph G = (V , E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a c