Abstract
In this paper, the connected dominating sets and total dominating sets in the lexicographic product of two graphs are characterized. Further, the connected domination, total domination, forcing connected domination and forcing total domination numbers of these graphs are determined.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
