𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimal universal trees

✍ Scribed by M. K. Gol'dberg; É. M. Livshits

Book ID
105077621
Publisher
SP MAIK Nauka/Interperiodica
Year
1968
Tongue
English
Weight
319 KB
Volume
4
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal minimal total dominating funct
Universal minimal total dominating functions of trees
✍ Alan Stacey 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We show that any tree that has a universal minimal total dominating function has one which only takes 0-1 values. K 3 demonstrates that this fails for graphs in general. Given a graph G =(V, E), for each vertex ve V let F(v) be the set of its neighbours (in particular, not including v itself). A to

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

Universal retrieval trees
Universal retrieval trees
✍ R.E. Krichevsky; B.Ya. Ryabko 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 430 KB
Minimal Huffman trees
Minimal Huffman trees
✍ Gunnar Forst; Anders Thorup 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 109 KB