Abstract
In this paper we characterize the differentiating-dominating sets in the join, corona, and lexicographic product of graphs. We also determine bounds or the exact differentiating-domination numbers of these graphs.
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
