Domination in Digraphs

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationDevelopments in Mathematics
Number of pages42
Publication statusPublished - 2021

Publication series

NameDevelopments in Mathematics
ISSN (Print)1389-2177
ISSN (Electronic)2197-795X


  • Matching number
  • Paired dominating set
  • Paired domination number

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Domination in Digraphs'. Together they form a unique fingerprint.

Cite this