Connected 2-domination in the corona of graphs

@article{Leonida2015Connected2I,
  title={Connected 2-domination in the corona of graphs},
  author={Rene E. Leonida},
  journal={Applied mathematical sciences},
  year={2015},
  volume={9},
  pages={3181-3186}
}
  • Rene E. Leonida
  • Published 2015
  • Physics
  • Applied mathematical sciences
  • A connected 2-dominating set of a graph G is a set S of vertices of G such that every vertex not in S is dominated at least twice and the subgraph induced by S is connected. In this paper, we characterized the connected 2-dominating sets of the join K1 + G and the corona of graphs and, obtain their connected 2-domination numbers. Mathematics Subject Classification: 05C69 

    References

    SHOWING 1-3 OF 3 REFERENCES
    Double domination in graphs under some binary operations
    • 8
    • PDF
    Bounds on the 2-domination number in cactus graphs
    • 22
    • PDF
    Independence and 2-domination in trees
    • 41
    • PDF