Abstract
An efficient total dominating set D of a graph G is a vertex subset such that every vertex of G has exactly one neighbor in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient total dominating sets of circulant graphs whose degree is 4.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
