Total domination in block graphs

Authors:
Gerard J Chang
Affiliations:
Department of Mathematics, National Central University, Chung-Li 32054, Institute of Information Science, Academia Sinica, Nankang, Taipei 11529, Taiwan, ROC
Venue:
Operations Research Letters
Year:
1989

Citing 5
Cited 1

Total domination in interval graphs

Information Processing Letters
R-Domination in Graphs

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
R-domination on block graphs

Operations Research Letters

Hardness results and approximation algorithm for total liar's domination in graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of vertices D is a dominating set for a graph G = (V, E) if every vertex in V - D is adjacent to a vertex in D. A set of vertices D is a total dominating set if every vertex in V is adjacent to a vertex in D. Chang and Nemhauser gave a linear time algorithm to find a minimum cardinality dominating set for the @k-th power of a block graph. This paper presents a linear time algorithm for finding a minimum cardinality total dominating set of a block graph.