Efficient domination in circulant graphs with two chord lengths

DOI10.1016/j.ipl.2007.02.004zbMath1184.68046OpenAlexW1995459940MaRDI QIDQ846022

Nenad Obradović, Goran Ružić, Joseph G. Peters

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.004

zbMATH Keywords

combinatorial problemscirculant graphefficient domination

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (29)

Cyclotomic graphs and perfect codes ⋮ Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Unnamed Item ⋮ 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 ⋮ Subgroups as efficient dominating sets in Cayley graphs ⋮ 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 domination in cubic vertex-transitive graphs ⋮ Efficient \(k\)-distance dominating set in Cayley graphs ⋮ On efficiently total dominatable digraphs ⋮ Efficient open domination in Cayley graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Domination on circulant graphs with two chord length ⋮ The cubic power graph of finite abelian groups ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups ⋮ Existence of efficient total dominating sets of circulant graphs of degree 4 ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ Unnamed Item ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Domination in Cayley graphs: a survey

Cites Work

• Hamiltonian decomposition of Cayley graphs of degree 4
• Efficient dominating sets in Cayley graphs.
• Independent perfect domination sets in Cayley graphs
• Point-symmetric graphs with a prime number of points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient domination in circulant graphs with two chord lengths