On the domination number of digraphs.

MaRDI QIDQ3134342zbMATH OpenFDO

Authors Guoliang Hao

Publication date 9 February 2018

zbMATH Keywords

domination numberdirected graphrooted treecontrafunctional digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On the sum of out-domination number and in-domination number of digraphs.
• Total domination in digraphs
• On the out-domination and in-domination numbers of a digraph
• On the \(k\)-domination number of digraphs
• The domination number of round digraphs

Cited in

(11)

• Domination in some classes of ditrees
• Total domination in digraphs
• The domination number of round digraphs
• On the difference of the domination number of a digraph and of its reverse
• Domination numbers on the Boolean function graph of a graph
• Packing and domination parameters in digraphs
• On the sum of out-domination number and in-domination number of digraphs.
• Domination and fractional domination in digraphs
• Domination parameters and Gallai-type theorems for directed trees.
• Bounds on the domination number of a digraph and its reverse
• Domination in digraphs

This page was built for publication: On the domination number of digraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134342)