In this paper, we take another look at the concept of secure weakly connected domination in graphs. In particular, we determine the secure weakly connected dominating sets of the join K 1 + G and the corona of two graphs and, compute their corresponding weakly connected domination numbers.