Lower Bounds on the Distance Domination Number of a Graph

zbMath1376.05108arXiv1507.08745MaRDI QIDQ4598363

Randy Davila, Franklin H. J. Kenter, Michael A. Henning, Caleb C. Fast

Publication date: 20 December 2017

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

zbMATH Keywords

domination number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Distance Domination in Graphs

This page was built for publication: Lower Bounds on the Distance Domination Number of a Graph