Secure weakly connected domination in the join of graphs

@article{Leonida2015SecureWC,
title={Secure weakly connected domination in the join of graphs},
author={Rene E. Leonida and Rendon A. Dela Cruz and Emmylou M. Aujero and Marchelle A. Deleverio and Nimfa L. Bodegas},
journal={International Journal of Mathematical Analysis},
year={2015},
volume={9},
pages={259-263}
}

In this paper, we take a look at the secure weakly connected domination in the join of graphs. In particular, we obtain the bounds for the secure weakly connected domination number of the join and, give necessary and sufficient conditions for the join to have secure weakly connected domination number equal to 1, 2 and 3. Mathematics Subject Classification: 05C69