The domination number of round digraphs
From MaRDI portal
Publication:2053549
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1334633 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1161297 (Why is no real title available?)
- A classification of locally semicomplete digraphs
- Approximately dominating representatives
- Digraphs
- Dominating sets in directed graphs
- Domination in 3-tournaments
- Infinite quasi-transitive digraphs with domination number 2
- Locally semicomplete digraphs: A generalization of tournaments
- On Subtournaments of a Tournament
- On the \(k\)-domination number of digraphs
- On the bounded domination number of tournaments
- Outer independent Roman dominating functions in graphs
- Outer independent double Roman domination
- Triple Roman domination in graphs
Cited in
(5)
This page was built for publication: The domination number of round digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053549)