Efficient domination in circulant graphs
From MaRDI portal
Publication:1942669
DOI10.1016/j.disc.2012.12.003zbMath1260.05115OpenAlexW1993350312MaRDI QIDQ1942669
K. Reji Kumar, Gary MacGillivray
Publication date: 19 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.12.003
Related Items (25)
Cyclotomic graphs and perfect codes ⋮ Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Total perfect codes in Cayley graphs ⋮ Classification of efficient dominating sets of circulant graphs of degree 5 ⋮ Independent perfect dominating sets in semi-Cayley graphs ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ Domination ratio of integer distance digraphs ⋮ Tight-optimal circulants vis-à-vis twisted tori ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ Perfect Codes in Cayley Graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Efficient \(k\)-distance dominating set in Cayley graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Constructing dominating sets in circulant graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ The game of Cops and Robber on circulant graphs ⋮ Existence of efficient total dominating sets of circulant graphs of degree 4 ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Domination in Cayley graphs: a survey
This page was built for publication: Efficient domination in circulant graphs
