Geodesic
A Labeling Algorithm for Distance Domination on Block Graphs
Bulletin of the Malaysian Mathematical Society, Tome 37 (2014) no. 4 Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website

Voir la notice de l'article

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.
Classification : 05C69, 05C12 
@article{BMMS_2014_37_4_a4,
     author = {Yancai Zhao and Erfang Shan and Zuosong Liang and Ruzhao Gao},
     title = {A {Labeling} {Algorithm} for {Distance} {Domination} on {Block} {Graphs}},
     journal = {Bulletin of the Malaysian Mathematical Society},
     year = {2014},
     volume = {37},
     number = {4},
     url = {http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a4/}
}
TY  - JOUR
AU  - Yancai Zhao
AU  - Erfang Shan
AU  - Zuosong Liang
AU  - Ruzhao Gao
TI  - A Labeling Algorithm for Distance Domination on Block Graphs
JO  - Bulletin of the Malaysian Mathematical Society
PY  - 2014
VL  - 37
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a4/
ID  - BMMS_2014_37_4_a4
ER  - 
%0 Journal Article
%A Yancai Zhao
%A Erfang Shan
%A Zuosong Liang
%A Ruzhao Gao
%T A Labeling Algorithm for Distance Domination on Block Graphs
%J Bulletin of the Malaysian Mathematical Society
%D 2014
%V 37
%N 4
%U http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a4/
%F BMMS_2014_37_4_a4
Yancai Zhao; Erfang Shan; Zuosong Liang; Ruzhao Gao. A Labeling Algorithm for Distance Domination on Block Graphs. Bulletin of the Malaysian Mathematical Society, Tome 37 (2014) no. 4. http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a4/