𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree

✍ Scribed by Michael A. Henning; Michael D. Plummer

Book ID
106406988
Publisher
Springer US
Year
2005
Tongue
English
Weight
508 KB
Volume
10
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertices contained in every minimum domi
Vertices contained in every minimum dominating set of a tree
✍ Mynhardt, C. M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating se

An independent dominating set in the com
An independent dominating set in the complement of a minimum dominating set of a tree
✍ Michael A. Henning; Christian LΓΆwenstein; Dieter Rautenbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 267 KB

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.

[IEEE Fourth International Conference on
[IEEE Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies - Chengdu, China (27-29 Aug. 2003)] Proceedings of the 8th International Scientific and Practical Conference of Students, Post-graduates and Young Scientists. Modern Technique and Technologies. MTT'2002 (Cat. No.02EX550) - A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks
✍ Kamei, S.; Kakugawa, H. πŸ“‚ Article πŸ“… 2003 πŸ› IEEE βš– 354 KB