| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429117 | Information Processing Letters | 2009 | 4 Pages |
Abstract
Let G=(V,E) be a simple graph without isolated vertices. A vertex set S⊆V is a paired-dominating set if every vertex in V−S has at least one neighbor in S and the induced subgraph G[S] has a perfect matching. In this paper, we present a linear-time algorithm to find a minimum paired-dominating set in strongly chordal graphs if the strong (elimination) ordering of the graph is given in advance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
