Algorithms to determine an independent dominating set of $ESC (n, k)$
S. Pious Missier, A. Anto Kinsley, Evangeline Prathibha Fernando · Malaya Journal of Matematik · 2014
The independent dominating set is an interesting property used in the allocation of finite resources in a massively parallel network such as the extended star graph with cross-connections ($ESC$). In this paper, we have initially designed algorithms to compute the independent dominating set of $ESC (n, k)$ for $ n = 2$ and $n = 3$. Using the hierarchical nature of the $ESC$ with its basic building block $ESC (n, 1)$ we have designed a generalized algorithm to compute the independent dominating set of $ESC (n, k$) for all $n$ and $k$.