On the difference of the domination number of a digraph and of its reverse

DOI10.1016/J.DAM.2011.12.029zbMATH Open1242.05202OpenAlexW2050629044MaRDI QIDQ423949FDOQ423949

Authors: Štefan Gyürki 

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

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
• On the domination number of digraphs.
• 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
• On \(n\)-inverse domination number in graphs

zbMATH Keywords

domination numberdirected graphtotal domination numberconversereverse digraph

Mathematics Subject Classification ID

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?)
• Title not available (Why is that?)
• On the out-domination and in-domination numbers of a digraph
• Database Theory - ICDT 2005
• Domination in a digraph and in its reverse

Cited In (6)

• Bounds on the domination number of a digraph and its reverse
• A note on Roman domination of digraphs
• Domination in a digraph and in its reverse
• Double Roman domination in digraphs
• Domination in Digraphs
• Delta invariant for Eulerian digraphs

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)