𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum Dominating Sets of Intervals on Lines

✍ Scribed by S. -W. Cheng; M. Kaminski; S. Zaks

Publisher
Springer
Year
1998
Tongue
English
Weight
169 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On minimum intersection of two minimum d
On minimum intersection of two minimum dominating sets of interval graphs
✍ Chang Maw-Shang; Hsu Chung-Chang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 748 KB

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.

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.

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
✍ Jerzy Topp πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s