𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimum intersection of two minimum dominating sets of interval graphs

✍ Scribed by Chang Maw-Shang; Hsu Chung-Chang

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
748 KB
Volume
78
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

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

On point-set domination in graphs IV: Se
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets
✍ B.D. Acharya; Purnima Gupta πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 675 KB

A set D of vertices in a graph G =-(V,E) is called a point-set dominating (or, psd-) set of G if for every nonempty subset S of V -D there exists v E D such that the induced subgraph (S U {v}) is connected (cf. Sampthkumar and Pushpa Latha (1993) [6]). Here, we report results of our investigation in