The domination number of round digraphs
From MaRDI portal
Publication:2053549
DOI10.1515/math-2020-0084zbMath1475.05147OpenAlexW3119332966MaRDI QIDQ2053549
Caijuan Xue, Rui Juan Li, Xin-Hong Zhang
Publication date: 29 November 2021
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2020-0084
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination in 3-tournaments
- Approximately dominating representatives
- Dominating sets in directed graphs
- A classification of locally semicomplete digraphs
- On the bounded domination number of tournaments
- Outer independent double Roman domination
- On the \(k\)-domination number of digraphs
- Infinite quasi-transitive digraphs with domination number 2
- Triple Roman domination in graphs
- Outer independent Roman dominating functions in graphs
- Locally semicomplete digraphs: A generalization of tournaments
- Digraphs
- On Subtournaments of a Tournament
This page was built for publication: The domination number of round digraphs