Abstract
Domination is an important property in the design of efficient computer interconnection networks. We provide a complete characterization of circulant graphs with two chord lengths that admit an efficient dominating set. In particular, for 3-regular and 4-regular circulant graphs, we give necessary and sufficient conditions for the existence of efficient dominating sets and we describe their exact structure according to the relationship between chords.
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.
