Total domination in digraphs

DOI10.2989/16073606.2017.1288664zbMath1423.05121OpenAlexW2596574929MaRDI QIDQ5236071

Guoliang Hao

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.1288664

zbMATH Keywords

directed graphrooted treetotal dominationcontrafunctional digraph

Mathematics Subject Classification ID

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

Related Items (5)

On the sum of the total domination numbers of a digraph and its converse ⋮ Domination in Digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Total Roman domination in digraphs ⋮ Packing and domination parameters in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect domination sets in Cayley graphs
• Approximately dominating representatives
• Rainbow domination in graphs
• Dominating sets in directed graphs
• Absorbant of generalized de Bruijn digraphs
• Bounds on the connected domination number of a graph
• The disjunctive domination number of a graph
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets

This page was built for publication: Total domination in digraphs