Bounds on the domination number of a digraph and its reverse
From MaRDI portal
Publication:5024936
DOI10.2298/FIL1807517FzbMath1499.05459MaRDI QIDQ5024936
Publication date: 1 February 2022
Published in: Filomat (Search for Journal in Brave)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the difference of the domination number of a digraph and of its reverse
- Independence in 5-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Domination in a digraph and in its reverse
- Dominating sets in directed graphs
- A survey of selected recent results on total domination in graphs
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- On the out-domination and in-domination numbers of a digraph
- Characterization of digraphs with equal domination graphs and underlying graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
This page was built for publication: Bounds on the domination number of a digraph and its reverse