Efficient k-distance dominating set in Cayley graphs

DOI10.1007/S40010-018-0539-XMaRDI QIDQ2212689zbMATH OpenOpenAlexFDO

Authors Doost Ali Mojdeh, A. Sayed-Khalkhali, Vladimir Samodivkin, H. Abdollahzadeh Ahangar

Publication date 24 November 2020

Published in Proceedings of the National Academy of Sciences, India. Section A. Physical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40010-018-0539-x

zbMATH Keywords

Cayley/circulant graphdistance dominationefficient distance domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Efficient domination in Cayley graphs of generalized dihedral groups
• Efficient open domination in Cayley graphs
• Subgroups as efficient dominating sets in Cayley graphs
• Efficient dominating sets in circulant graphs with domination number prime
• k-efficient partitions of graphs

Cites work

• A theory of Cartesian product and factorization of circulant graphs
• Bounds for domination parameters in Cayley graphs on dihedral group
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3999824 (Why is no real title available?)
• Independent perfect domination sets in Cayley graphs
• Relations between packing and covering numbers of a tree
• Total \(k\)-distance domination critical graphs

Cited in

(2)

• k-efficient partitions of graphs
• On bounds and exact values of k-efficient domination number of a graph

This page was built for publication: Efficient \(k\)-distance dominating set in Cayley graphs

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