Volume 37 • Number 4 • 2014   • A Labeling Algorithm for Distance Domination on Block Graphs Yancai Zhao, Erfang Shan, Zuosong Liang and Ruzhao Gao 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. 2010 Mathematics Subject Classification: 05C69, 05C12 Full text: PDF