Independent Domination of k-Trees

Abstract: Given a simple finite graph $G=(V(G),E(G))$, a vertex subset $D\subseteq V(G)$ is said to be a dominating set if every vertex $v\in V(G)-D$ is adjacent to a vertex in $D$. The independent domination number $\gamma_i(G)$ is the minimum cardinality among all independent dominating sets of $G$. As the problem of finding the domination number for general graphs is NP-complete, we focus on the class of $k$-trees. In particular, we determine a tight upper bound for the independent domination number of $k$-trees for all $k\in \mathbb{N}$.