Domination in Digraphs
2021
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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
69
References
1
Citations
NaN
KQI