Corpus ID: 67794691

Connected 2-Domination in the Join of Graphs

@inproceedings{Leonida2015Connected2I,
  title={Connected 2-Domination in the Join of Graphs},
  author={Rene E. Leonida},
  year={2015}
}
  • Rene E. Leonida
  • Published 2015
  • 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 of graphs and obtain its connected 2-domination number. Also, we give necessary and sufficient conditions for the join of graphs to have connected 2-domination numbers equal to 2, 3, and 4. Mathematics Subject Classification: 05C69 
    1 Citations

    Figures from this paper

    Independent 2-domination in graphs
    • PDF

    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