The domination number of round digraphs
From MaRDI portal
Publication:2053549
DOI10.1515/MATH-2020-0084zbMATH Open1475.05147OpenAlexW3119332966MaRDI QIDQ2053549FDOQ2053549
Authors: Caijuan Xue, Ruijuan Li, Xinhong 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- A classification of locally semicomplete digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- Title not available (Why is that?)
- Digraphs
- On Subtournaments of a Tournament
- Title not available (Why is that?)
- Dominating sets in directed graphs
- On the \(k\)-domination number of digraphs
- Domination in 3-tournaments
- Approximately dominating representatives
- Title not available (Why is that?)
- Outer independent double Roman domination
- Triple Roman domination in graphs
- On the bounded domination number of tournaments
- Outer independent Roman dominating functions in graphs
- Infinite quasi-transitive digraphs with domination number 2
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)