𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Expected Size of the Rule k Dominating Set

✍ Scribed by Jennie C. Hansen; Eric Schmutz; Li Sheng

Publisher
Springer
Year
2006
Tongue
English
Weight
182 KB
Volume
46
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An independent dominating set in the com
An independent dominating set in the complement of a minimum dominating set of a tree
✍ Michael A. Henning; Christian LΓΆwenstein; Dieter Rautenbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 267 KB

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.

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

The Set of Dominance-Minimal Roots
The Set of Dominance-Minimal Roots
✍ Brigitte Brink πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 419 KB

If ␣ and ␀ are positive roots in the root system of a Coxeter group W, we say that ␣ dominates ␀ if w␀ is negative whenever w␣ is negative for w g W. We say that ␣ is elementary or dominance-minimal, if it does not dominate any ␀ / ␣. It Ž . is shown by the author and R. B. Howlett Math. Ann. 296, 1

On the Expected Size of Recursive Datalo
On the Expected Size of Recursive Datalog Queries
✍ S. Seshadri; J.F. Naughton πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 998 KB

We present asymptotically exact expressions for the expected sizes of relations defined by three well-studied Datalog recursions, namely the "transitive closure," "same generation," and "canonical factorable recursion." We consider the size of the fixpoints of the recursively defined relations in th