• DOI:10.12988/IJMA.2015.412390
Corpus ID: 125753643

Secure weakly connected domination in the corona of graphs

@article{Leonida2015SecureWC,
  title={Secure weakly connected domination in the corona of graphs},
  author={Rene E. Leonida},
  journal={International Journal of Mathematical Analysis},
  year={2015},
  volume={9},
  pages={265-269}
}

Rene E. Leonida

Published 2015

Computer Science

International Journal of Mathematical Analysis

View PDF

Save to Library

Create Alert

Cite

Launch Research Feed

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 K1 +G and the corona of two graphs and, compute their corresponding weakly connected domination numbers. Mathematics Subject Classification: 05C69