Return to search

Domination in Digraphs

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-11064
Date01 January 2021
CreatorsHaynes, Teresa W., Hedetniemi, Stephen T., Henning, Michael A.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.002 seconds