On the difference of the domination number of a digraph and of its reverse
From MaRDI portal
Publication:423949
DOI10.1016/J.DAM.2011.12.029zbMATH Open1242.05202OpenAlexW2050629044MaRDI QIDQ423949FDOQ423949
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.029
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (5)
Recommendations
- Bounds on the domination number of a digraph and its reverse ๐ ๐
- On the sum of the total domination numbers of a digraph and its converse ๐ ๐
- Domination in a digraph and in its reverse ๐ ๐
- On the \(k\)-domination number of digraphs ๐ ๐
- Title not available (Why is that?) ๐ ๐
- On the out-domination and in-domination numbers of a digraph ๐ ๐
- The domination number of round digraphs ๐ ๐
- On the domination number of a graph ๐ ๐
- Bounds on the domination number of a digraph ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: On the difference of the domination number of a digraph and of its reverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423949)