Bounds on the domination number of a digraph

DOI10.1007/s10878-017-0154-9zbMath1386.05133OpenAlexW2736252517MaRDI QIDQ1698058

Guoliang Hao, Jian Guo Qian

Publication date: 21 February 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0154-9

zbMATH Keywords

directed graphdomination numberSlater numberout-degree sequence

Mathematics Subject Classification ID

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

Related Items (5)

Domination parameters on Cayley digraphs of transformation semigroups with fixed sets ⋮ Double Roman domination in digraphs ⋮ Unnamed Item ⋮ Domination in Digraphs ⋮ Orientable domination in product-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signed total Roman domination in graphs
• Improved bounds on the domination number of a tree
• Directed domination in oriented graphs
• On connected domination in unit ball graphs
• Approximately dominating representatives
• Independent domination of grids
• Absorbant of generalized de Bruijn digraphs
• Signed Roman domination in graphs
• Total Domination in Graphs with Diameter 2
• Bounding the paired-domination number of a tree in terms of its annihilation number
• Dominating Set and Converse Dominating Set of a Directed Graph

This page was built for publication: Bounds on the domination number of a digraph