Secure Weakly Convex Domination in Graphs

@article{Leonida2015SecureWC,
  title={Secure Weakly Convex Domination in Graphs},
  author={Rene E. Leonida},
  journal={Applied mathematical sciences},
  year={2015},
  volume={9},
  pages={143-147}
}
  • Rene E. Leonida
  • Published 2015
  • Mathematics
  • Applied mathematical sciences
  • In this paper, we investigate the concept of secure weakly convex domination set of some graphs. We characterized those graphs for which the secure weakly convex domination numbers are 1 and 2. Relations of this parameter with some domination parameters are also observed and a graph is constructed with a preassigned order, weakly convex domination number, secure weakly convex domination number, and secure convex domination number. 

    Figures from this paper

    References

    SHOWING 1-5 OF 5 REFERENCES
    Secure domination in the joins of graphs
    • 13
    • PDF
    Weakly convex and convex domination numbers
    • 36
    • PDF
    Weakly convex and weakly connected independent dominations in the corona of graphs
    • 11
    • PDF
    Domination in the Corona and Join of Graphs
    • 33
    • PDF