In this paper, we explore the concept of restrained weakly connected domination in graphs. In particular, we characterized the restrained weakly connected dominating sets in the join and corona of graphs and as a consequence, their restrained weakly connected domination numbers are obtained. A connected graph is constructed with a given order, weakly connected domination number, and restrained weakly connected domination number.