@inbook{8da5b2e8c2f349479a06618339803abd,

title = "Paired Domination in Graphs",

abstract = "A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G. This chapter presents a survey of the major results on paired domination with an emphasis on bounds for the paired domination number.",

keywords = "Matching number, Paired dominating set, Paired domination number",

author = "Desormeaux, {Wyatt J.} and Haynes, {Teresa W.} and Henning, {Michael A.}",

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

year = "2020",

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

language = "English",

series = "Developments in Mathematics",

publisher = "Springer",

pages = "31--77",

booktitle = "Developments in Mathematics",

address = "Germany",

}