✦ LIBER ✦

Coordinatizing R-trees in terms of universal c-trees

✍ Scribed by Werner F. Terhalle

Book ID: 110555581
Publisher: Springer
Year: 1997
Tongue: English
Weight: 553 KB
Volume: 1
Category: Article
ISSN: 0218-0006
DOI: 10.1007/bf02558474

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Encoding phylogenetic trees in terms of

Encoding phylogenetic trees in terms of weighted quartets

✍ Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Charles Semple 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 225 KB

Universal coding of integers and unbound

Universal coding of integers and unbounded search trees

✍ Ahlswede, R.; Te Sun Han; Kobayashi, K. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 673 KB

Characterization of partial 3-trees in t

Characterization of partial 3-trees in terms of three structures

✍ Yoji Kajitani; Akio Ishizuka; Shuichi Ueno 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 837 KB

A property of trees in terms of unique c

A property of trees in terms of unique connected subgraphs

✍ Stephen T. Hedetniemi; Diane M. Spresser 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract The following theorem is proved: Let __G__ be a graph with __p__ ≥ 3 points such that for some __n__, 3 ≤ __n__ ≤ __p__, any __n__ points lie on a unique smallest connected subgraph. Then __G__ = __C__~__n__~+1 or __G__ is a tree, and conversely.

Diseases of Trees

✍ C. R. B. 📂 Article 📅 1909 🏛 The University of Chicago Press ⚖ 259 KB

A characterisation of universal minimal

A characterisation of universal minimal total dominating functions in trees

✍ E.J. Cockayne; C.M. Mynhardt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 445 KB

A total dominating function (TDF) of a graph G = (V, E) is a function f: V~ [0, 1] such that for each v~ V, ~u~Ntv)f(u)>~ 1, where N(v) denotes the set of neighbours of v. Although convex combinations of TDFs are also TDFs, convex combinations of minimal TDFs (MTDFs) are not necessarily minimal. An