𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On digraphs with a rooted tree structure

✍ Scribed by Jayme L. Szwarcfiter

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
373 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Data Structure for Dynamically Maintai
A Data Structure for Dynamically Maintaining Rooted Trees
✍ Greg N. Frederickson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 274 KB

The directed topology tree data structure is developed for maintaining binary trees dynamically. Each of a certain set of tree operations is shown to take Ž . Olog n time, where n is the number of vertices in the trees. The directed topology trees are used to implement link᎐cut trees and dynamic exp

On the existence of a specified cycle in
On the existence of a specified cycle in digraphs with constraints on degrees
✍ Abdelhamid Benhocine πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 326 KB πŸ‘ 1 views

We prove that Woodall's and GhouileHouri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by

Studies on the root nodules of leguminou
Studies on the root nodules of leguminous trees V. Production of indole acetic acid by a Bradyrhizobium sp. from the root nodules of a leguminous tree, Acacia auriculiformis A. CUNN
✍ R. N. Bhattacharyya; Dr. P. S. Basu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 398 KB

The Brn~i~rhi=ohiuni sp.. isolated from the root nodules of Acnciu uirriculIforttzis A. CUNN.. a member of Mitnosuceae, produced 17.0 pg/ml of indole acetic acid (IAA) from tryptophan in culture. The bacteria preferred D-isomer over UL-or 1.-isomer of tryptophan for IAA production. The IAA productio

A note on graphs with diameter-preservin
A note on graphs with diameter-preserving spanning trees
✍ Fred Buckley; Martin Lewinter πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 182 KB πŸ‘ 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th