Packing and domination parameters in digraphs

DOI10.1016/j.dam.2019.04.008zbMath1423.05074arXiv1805.04038OpenAlexW2801836973WikidataQ127924378 ScholiaQ127924378MaRDI QIDQ2328107

Doost Ali Mojdeh, Babak Samadi, Ismael González Yero

Publication date: 9 October 2019

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

Full work available at URL: https://arxiv.org/abs/1805.04038

zbMATH Keywords

packing numberdomination numbertotal domination numberdirected treecontrafunctional digraphopen domination number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (max. 100)

Domination in digraphs and their direct and Cartesian products ⋮ Orientable domination in product-like graphs

Cites Work

• Efficient total domination in digraphs
• Domination, independent domination, and duality in strongly chordal graphs
• A survey of selected recent results on total domination in graphs
• Relations between packing and covering numbers of a tree
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Total Domination in Graphs
• Total domination in digraphs
• Dominating Set and Converse Dominating Set of a Directed Graph
• On a Problem in Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing and domination parameters in digraphs