𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dominating functions and total dominating functions of countable graphs

✍ Scribed by Vijayakumar, G.R.

Book ID
121240850
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
589 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Convexity of minimal total dominating fu
Convexity of minimal total dominating functions in graphs
✍ Yu, Bo πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 2 views

A total dominating function (TDF) of a graph G = (V, E) is a function f : V β†’ [0, 1] such that for each v ∈ V , the sum of f values over the open neighbourhood of v is at least one. Zero-one valued TDFs are precisely the characteristic functions of total dominating sets of G. We study the convexity

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

Total dominating functions in trees: Min
Total dominating functions in trees: Minimality and convexity
✍ E. J. Cockayne; C. M. Mynhardt; Bo Yu πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 380 KB

## Abstract 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Ο΅N(v)~ f(u) β‰₯ 1 (where __N__(__v__) denotes the set of neighbors of vertex __v__). Convex combinations of TDFs are also TDFs. However, convex combinations