If there is at least one neighbour in K for each vertex in V  that is not in K, then a set \(K\subseteq V(G)\) is a dominating set (DS) in \(G(V,E)\) . The minimal cardinality of a DS of G is the domination number(DN) of G, represented by \(\gamma (G)\) . In this paper, we determine the \(\gamma (G)\) for Sierpiński networks, \(S_{t}^{r}\) and the divide-and-swap cubic networks, \(DSC_{r}\) .