On the out-domination and in-domination numbers of a digraph

DOI10.1016/S0012-365X(99)90059-6zbMATH Open0978.05057OpenAlexW4210490117MaRDI QIDQ1292825FDOQ1292825

Authors: Frank Harary, Bill Quan Yue, Gary Chartrand 

Publication date: 27 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90059-6

Recommendations

• Sum of out-domination number and in-domination number of digraphs
• On the sum of out-domination number and in-domination number of digraphs.
• On the domination number of digraphs.
• Bounds on the domination number of a digraph and its reverse
• On the \(k\)-domination number of digraphs

zbMATH Keywords

digraphin-dominationout-domination

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?)
• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)

Cited In (26)

• On the sum of the total domination numbers of a digraph and its converse
• Title not available (Why is that?)
• Domination number of an interval catch digraph family and its use for testing uniformity
• Bounds on the domination number of a digraph and its reverse
• Extremal \(k\)-forcing sets in oriented graphs
• Characterization of digraphs with equal domination graphs and underlying graphs
• On the sum of out-domination number and in-domination number of digraphs.
• \(k\)-distinct in- and out-branchings in digraphs
• On the difference of the domination number of a digraph and of its reverse
• A greedy partition lemma for directed domination
• A note on lower bounds for the total domination number of digraphs
• Domination in a digraph and in its reverse
• On the \((h,k)\)-domination numbers of iterated line digraphs
• Domination in digraphs
• Dominating sets in directed graphs
• Efficient dominating sets in labeled rooted oriented trees
• Bounds on the domination number in oriented graphs
• On the domination number of digraphs.
• The domination number of round digraphs
• Rainbow reinforcement numbers in digraphs
• Domination and fractional domination in digraphs
• Directed domination in oriented graphs
• Title not available (Why is that?)
• Sum of out-domination number and in-domination number of digraphs
• On the domination polynomial of a digraph: a generation function approach
• Partitioning vertices into in- and out-dominating sets in digraphs

This page was built for publication: On the out-domination and in-domination numbers of a digraph

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