YANCAI ZHAO, ERFANG SHAN, ZUOSONG LIANG, and RUZHAO GAO
Subjects
*DOMINATING set, *GEOMETRIC vertices, *INTEGERS, *LINEAR time invariant systems, *ALGORITHMS
Abstract
The k-distance domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or within distance k from some vertex of D, where k is a positive integer. In the present paper, by using labeling method, a linear-time algorithm for k-distance domination problem on block graphs is designed. [ABSTRACT FROM AUTHOR]
Published
2014
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.