Efficient domination in circulant graphs with two chord lengths

From MaRDI portal
Publication:846022


DOI10.1016/j.ipl.2007.02.004zbMath1184.68046MaRDI 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


68M10: Network design and communication in computer systems

68R05: Combinatorics in computer science

68R10: Graph theory (including graph drawing) in computer science


Related Items

Perfect Codes in Cayley Graphs, Unnamed Item, Subgroup Perfect Codes in Cayley Graphs, The cubic power graph of finite abelian groups, Colouring clique-hypergraphs of circulant graphs, Total perfect codes in Cayley graphs, Subgroups as efficient dominating sets in Cayley graphs, Tight-optimal circulants vis-à-vis twisted tori, Efficient dominating sets in circulant graphs with domination number prime, Efficient domination in cubic vertex-transitive graphs, Efficient open domination in Cayley graphs, Domination on circulant graphs with two chord length, Efficient dominating sets in circulant graphs, Perfect codes in circulant graphs, Cyclotomic graphs and perfect codes, On efficiently total dominatable digraphs, On bondage numbers of graphs: a survey with some comments, Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups, Independent perfect domination sets in semi-Cayley graphs, Domination ratio of a family of integer distance digraphs with arbitrary degree, Efficient domination in Cayley graphs of generalized dihedral groups, Classification of efficient dominating sets of circulant graphs of degree 5, Efficient \(k\)-distance dominating set in Cayley graphs, Existence of efficient total dominating sets of circulant graphs of degree 4, Characterization of subgroup perfect codes in Cayley graphs, Domination in Cayley graphs: a survey, Domination ratio of integer distance digraphs, Independent perfect dominating sets in semi-Cayley graphs, Unnamed Item



Cites Work