Weakly connected dominating sets in the lexicographic product of graphs

@article{Sandueta2014WeaklyCD,
  title={Weakly connected dominating sets in the lexicographic product of graphs},
  author={Elsie P. Sandueta and S. Canoy},
  journal={International Journal of Mathematical Analysis},
  year={2014},
  volume={8},
  pages={1973-1980}
}
  • Elsie P. Sandueta, S. Canoy
  • Published 2014
  • Mathematics
  • International Journal of Mathematical Analysis
  • In this paper we characterize the weakly connected dominating sets in the lexicographic product of two connected graphs. From these characterization, we easily determine the weakly connected domination number of the corresponding graph. Mathematics Subject Classification: 05C69 
    2 Citations

    References

    SHOWING 1-3 OF 3 REFERENCES
    On weakly connected domination in graphs
    • 67
    Weakly Connected Domination in Graphs Resulting from Some Graph Operations
    • 6
    • PDF
    Weakly connected domination critical graphs
    • 9