Efficient domination in circulant graphs with two chord lengths

Authors:
Nenad Obradović;Joseph Peters;Goran Ružić
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada;School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada;School of Computing Science, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 2

Hamiltonian decomposition of Cayley graphs of degree 4

Journal of Combinatorial Theory Series B
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks

IEEE Transactions on Parallel and Distributed Systems
Efficient dominating sets in Cayley graphs

Discrete Applied Mathematics
Independent perfect domination sets in Cayley graphs

Journal of Graph Theory

Efficient domination in cubic vertex-transitive graphs

European Journal of Combinatorics
Subgroups as efficient dominating sets in Cayley graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

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.