Upper bounds for \(\alpha \)-domination parameters

DOI10.1007/s00373-009-0864-6zbMath1216.05103arXiv0805.0612OpenAlexW1641711201MaRDI QIDQ844230

Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich

Publication date: 18 January 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-tuple domination\(\alpha \)-domination number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20)

Related Items

Edge-removal and edge-addition in \(\alpha \)-domination ⋮ Multiple domination models for placement of electric vehicle charging stations in road networks ⋮ On \(\alpha\)-total domination in graphs ⋮ On \(\alpha \)-domination in graphs ⋮ A note on \(\alpha\)-total domination in cubic graphs ⋮ Onk-tuple domination of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments on data reduction for optimal domination in networks
• \(\alpha \)-domination perfect trees
• The \(k\)-tuple domination number revisited
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On the ratio of optimal integral and fractional covers
• A generalised upper bound for the \(k\)-tuple domination number
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Dominating a Family of Graphs with Small Connected Subgraphs
• Onk-domination and minimum degree in graphs
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs