Efficient domination in circulant graphs with two chord lengths

DOI10.1016/J.IPL.2007.02.004MaRDI QIDQ846022zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Efficient domination in circulant graphs
• Efficient dominating sets in circulant graphs
• Efficient dominating sets in circulant graphs
• Constructing dominating sets in circulant graphs
• Efficient dominating sets in circulant graphs with domination number prime

Cites work

• scientific article; zbMATH DE number 3733976 (Why is no real title available?)
• scientific article; zbMATH DE number 1156590 (Why is no real title available?)
• scientific article; zbMATH DE number 842019 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• Efficient dominating sets in Cayley graphs.
• Hamiltonian decomposition of Cayley graphs of degree 4
• Independent perfect domination sets in Cayley graphs
• Point-symmetric graphs with a prime number of points

Cited in

(34)

• Efficient \(k\)-distance dominating set in Cayley graphs
• Linear and non-linear loop-transversal codes in error-correction and graph domination
• Characterization of subgroup perfect codes in Cayley graphs
• Efficient dominating sets in circulant graphs with domination number prime
• The cubic power graph of finite abelian groups
• Constructing dominating sets in circulant graphs
• Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
• Tight-optimal circulants vis-à-vis twisted tori
• Efficient domination in Cayley graphs of generalized dihedral groups
• Domination in Cayley graphs: a survey
• Efficient open domination in Cayley graphs
• Perfect codes in 2-valent Cayley digraphs on abelian groups
• Regular sets in circulant graphs with degree 3
• Subgroup Perfect Codes in Cayley Graphs
• Total perfect codes in Cayley graphs
• scientific article; zbMATH DE number 7255560 (Why is no real title available?)
• Independent perfect domination sets in semi-Cayley graphs
• Efficient domination in cubic vertex-transitive graphs
• Perfect codes in circulant graphs
• Independent perfect dominating sets in semi-Cayley graphs
• On bondage numbers of graphs: a survey with some comments
• Existence of efficient total dominating sets of circulant graphs of degree 4
• Colouring clique-hypergraphs of circulant graphs
• On efficiently total dominatable digraphs
• Classification of efficient dominating sets of circulant graphs of degree 5
• On regular sets in Cayley graphs
• Cyclotomic graphs and perfect codes
• Efficient domination in circulant graphs
• Domination ratio of a family of integer distance digraphs with arbitrary degree
• Domination on circulant graphs with two chord length
• Perfect codes in Cayley graphs
• Domination ratio of integer distance digraphs
• Subgroups as efficient dominating sets in Cayley graphs
• Efficient dominating sets in circulant graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846022)