On the sum of out-domination number and in-domination number of digraphs.

MaRDI QIDQ2804807zbMATH OpenFDO

Authors Guoliang Hao, Jianguo Qian

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

rooted treecontrafunctional digraphin-domination numberout-domination number

Mathematics Subject Classification ID

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

Recommendations

• On the domination number of digraphs.
• On the out-domination and in-domination numbers of a digraph
• Sum of out-domination number and in-domination number of digraphs
• Total domination in digraphs
• On the sum of the total domination numbers of a digraph and its converse

Cited in

(12)

• On the sum of the total domination numbers of a digraph and its converse
• Bounds on the domination number of a digraph and its reverse
• A note on Roman domination of digraphs
• Bounds on the signed Roman \(k\)-domination number of a digraph
• A note on lower bounds for the total domination number of digraphs
• Domination parameters and Gallai-type theorems for directed trees.
• Domination in digraphs
• On the domination number of digraphs.
• Bounds on the domination number of a digraph
• On the rainbow domination number of digraphs
• Total domination in digraphs
• Sum of out-domination number and in-domination number of digraphs

This page was built for publication: On the sum of out-domination number and in-domination number of digraphs.

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