𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the total restrained domination number of a tree

✍ Scribed by Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert

Publisher
Springer US
Year
2008
Tongue
English
Weight
529 KB
Volume
20
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the k-domination numb
An upper bound for the k-domination number of a graph
✍ E. J. Cockayne; B. Gamble; B. Shepherd πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).