A note on lower bounds for the total domination number of digraphs

DOI10.2989/16073606.2017.1302517zbMath1423.05122OpenAlexW2605561828MaRDI QIDQ5236092

Guoliang Hao, Xiaodan Chen

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1302517

zbMATH Keywords

directed graphoriented treetotal domination numberout-degreeout-Slater number

Mathematics Subject Classification ID

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

Related Items (3)

On the sum of the total domination numbers of a digraph and its converse ⋮ Domination in Digraphs ⋮ Total Roman domination in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the rainbow domination number of digraphs
• Improved bounds on the domination number of a tree
• Directed domination in oriented graphs
• Perfect domination sets in Cayley graphs
• Approximately dominating representatives
• On the out-domination and in-domination numbers of a digraph
• Signed domination in regular graphs
• Total domination and matching numbers in graphs with all vertices in triangles
• Rainbow domination in the lexicographic product of graphs
• Bounds on the Global Domination Number

This page was built for publication: A note on lower bounds for the total domination number of digraphs