𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Centroids to centers in trees

✍ Scribed by K. B. Reid

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
330 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Centers to centroids in graphs
Centers to centroids in graphs
✍ Peter J. Slater πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 527 KB

For S E V(G) the S-center and S-centroid of G are defined as the collection of vertices u E V(G) that minimize eJu) = max {d (u, v ) : V E S} and & ( u ) =IveS d (u, v), respectively. This generalizes the standard definition of center and centroid from the.special case of S = V(G). For is defined t

Improved solutions to the one-center McM
Improved solutions to the one-center McMurchieβ€”Davidson tree search problem
✍ Gerardo Cisneros πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 264 KB

We present an improvement to Johnson, Gill, and Pople's results for reducing the cost of using the McMurchie-Davidson RNLM recurrence relation for one-center integrals. Recursive replacement of singly referenced and single-term auxiliary integrals results in floating point operation (nor) savings of

Addendum to β€œtrees in random graphs”
Addendum to β€œtrees in random graphs”
✍ P ErdΓΆs; Z Palka πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 30 KB

The aim of this addendum is to explain more precisely the second part of the proof of Theorem 1 from our paper [1]. We need to show that a.e. graph G e~J(n,p) contains a maximal induced tree of order less than (l+e)X (log n)/(log d). The second moment method used in our Lemma shows in fact that