TY - CHAP
T1 - Domination in Digraphs
AU - Haynes, Teresa W.
AU - Hedetniemi, Stephen T.
AU - Henning, Michael A.
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for every vertex v in V \ S, there are a vertex u in S and an arc (u, v) from u to v. In this chapter we consider the counterparts in directed graphs of independent, dominating, independent dominating, and total dominating sets in undirected graphs.
AB - Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for every vertex v in V \ S, there are a vertex u in S and an arc (u, v) from u to v. In this chapter we consider the counterparts in directed graphs of independent, dominating, independent dominating, and total dominating sets in undirected graphs.
KW - Matching number
KW - Paired dominating set
KW - Paired domination number
UR - http://www.scopus.com/inward/record.url?scp=85105535527&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-58892-2_13
DO - 10.1007/978-3-030-58892-2_13
M3 - Chapter
AN - SCOPUS:85105535527
T3 - Developments in Mathematics
SP - 387
EP - 428
BT - Developments in Mathematics
PB - Springer
ER -