Constructing dominating sets in circulant graphs

DOI10.1007/S00026-018-0377-1MaRDI QIDQ1745909zbMATH OpenOpenAlexFDO

Authors Igor E. Shparlinski

Publication date 18 April 2018

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.01286

zbMATH Keywords

dominating setcirculant graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: We give an efficient construction of a reasonably small dominating set in a circulant graph on $n$ notes and $k$ distinct chord lengths. This result is based on bounds on some double exponential sums. .

Recommendations

• Domination on circulant graphs with two chord length
• Efficient dominating sets in circulant graphs
• scientific article; zbMATH DE number 6120615
• Efficient domination in circulant graphs with two chord lengths
• Efficient dominating sets in circulant graphs

Cites work

• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 6120615 (Why is no real title available?)
• A note on distance domination numbers of graphs
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Efficient open domination in Cayley graphs
• Exponential Sums with Farey Fractions
• Modern computer algebra
• On a Problem of Additive Number Theory
• On covering by translates of a set
• On upper bounds for multiple domination numbers of graphs
• Subgroups as efficient dominating sets in Cayley graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(4)

• Construction and estimation of dominating sets in communication structures
• On dominating set polyhedra of circular interval graphs
• Efficient domination in circulant graphs with two chord lengths
• Domination on circulant graphs with two chord length

This page was built for publication: Constructing dominating sets in circulant graphs

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