Constructing dominating sets in circulant graphs

DOI10.1007/s00026-018-0377-1zbMath1391.05131arXiv1602.01286OpenAlexW2964193342MaRDI QIDQ1745909

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgroups as efficient dominating sets in Cayley graphs
• Efficient open domination in Cayley graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• On upper bounds for multiple domination numbers of graphs
• Modern Computer Algebra
• On covering by translates of a set
• Exponential Sums with Farey Fractions
• On a Problem of Additive Number Theory

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