𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimization of function defined on a tree

✍ Scribed by L. M. Frid

Publisher
Springer US
Year
1973
Tongue
English
Weight
469 KB
Volume
6
Category
Article
ISSN
1573-8337

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

Convexity of minimal dominating function
Convexity of minimal dominating functions of trees β€” II
✍ E.J. Cockayne; G. MacGillivray; C.M. Mynhardt πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 580 KB

The relation Ye on the set of minimal dominating functions (MDFs) of a finite graph G is defined by f&?g if and only if any convex combination off and g is also an MDF. If fis a nonintegral MDF of a tree, the existence of another MDF with fewer nonintegral values and other desirable properties is es