Efficient domination in circulant graphs with two chord lengths
DOI10.1016/J.IPL.2007.02.004zbMATH Open1184.68046OpenAlexW1995459940MaRDI QIDQ846022FDOQ846022
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
Recommendations
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Hamiltonian decomposition of Cayley graphs of degree 4
- Title not available (Why is that?)
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- Title not available (Why is that?)
- Point-symmetric graphs with a prime number of points
- Title not available (Why is that?)
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
- Efficient domination in Cayley graphs of generalized dihedral groups
- Tight-optimal circulants vis-à-vis twisted tori
- Domination in Cayley graphs: a survey
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Efficient open domination in Cayley graphs
- Regular sets in circulant graphs with degree 3
- Subgroup Perfect Codes in Cayley Graphs
- Title not available (Why is that?)
- Total perfect codes in Cayley graphs
- Independent perfect domination sets in semi-Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- Independent perfect dominating sets in semi-Cayley graphs
- Perfect codes in circulant graphs
- On bondage numbers of graphs: a survey with some comments
- Colouring clique-hypergraphs of circulant graphs
- Existence of efficient total dominating sets of circulant graphs of degree 4
- 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
- Perfect codes in Cayley graphs
- Domination on circulant graphs with two chord length
- 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)
