Back to Search
Start Over
Distance paired-domination problems on subclasses of chordal graphs
- Source :
-
Theoretical Computer Science . Nov2009, Vol. 410 Issue 47-49, p5072-5081. 10p. - Publication Year :
- 2009
-
Abstract
- Abstract: Let be a graph without isolated vertices. For a positive integer , a set is a -distance paired-dominating set if each vertex in is within distance of a vertex in and the subgraph induced by contains a perfect matching. In this paper, we present two linear time algorithms to find a minimum cardinality -distance paired-dominating set in interval graphs and block graphs, which are two subclasses of chordal graphs. In addition, we present a characterization of trees with unique minimum -distance paired-dominating set. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 410
- Issue :
- 47-49
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 44584568
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.08.005