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
  • 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 

    References

    SHOWING 1-5 OF 5 REFERENCES
    Secure domination in the joins of graphs
    • 13
    • PDF
    Weakly connected independent domination in the join of graphs
    • 6
    • PDF
    Weakly Connected Domination in Graphs Resulting from Some Graph Operations
    • 6
    • PDF