@inbook{1157c5ba34e141e9bc311dc491370590,

title = "Distance Domination in Graphs",

abstract = "For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) ∖ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this chapter, we survey selected results on the k-domination number of a graph.",

keywords = "Distance domination, Domination",

author = "Henning, {Michael A.}",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.",

year = "2020",

doi = "10.1007/978-3-030-51117-3_7",

language = "English",

series = "Developments in Mathematics",

publisher = "Springer",

pages = "205--250",

booktitle = "Developments in Mathematics",

address = "Germany",

}