TY - JOUR
ID - 4029
TI - A linear-time algorithm to compute total $[1,2]$-domination number of block graphs
JO - AUT Journal of Mathematics and Computing
JA - AJMC
LA - en
SN - 2783-2449
AU - Sharifani, Pouyeh
AU - Hooshmandasl, Mohammadreza
AU - Alikhani, Saeid
AD - Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
AD - Department of Computer Science, University of Mohaghegh Ardabili, Ardabil, Iran
AD - Department of Mathematics, Yazd University, Yazd, Iran
Y1 - 2020
PY - 2020
VL - 1
IS - 2
SP - 263
EP - 270
KW - Total $[1,2]$-set
KW - Dominating set
KW - Block graph
DO - 10.22060/ajmc.2020.18444.1035
N2 - Let $G=(V, E)$ be a simple graph without isolated vertices. A set $D\subseteq V$ is a total $[1,2]$-dominating set if for every vertex $v\in V , 1\leq |N(v)\cap D|\leq 2$. The total $[1,2]$-domination problem is to determine the total $[1,2]$-domination number $\gamma_{t[1,2]}(G)$, which is the minimum cardinality of a total $[1,2]$-dominating set for a graph $G$. In this paper, we present a linear-time algorithm to compute $\gamma_{t[1,2]}(G)$, for a block graph $G$.
UR - https://ajmc.aut.ac.ir/article_4029.html
L1 - https://ajmc.aut.ac.ir/article_4029_37ba0eb98b8dee9c894950fe396e5321.pdf
ER -