𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding a minimum independent dominating set in a permutation graph

✍ Scribed by Mikhail J. Atallah; Glenn K. Manacher; J. Urrutia

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
862 KB
Volume
21
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.