Domination in digraphs and their direct and Cartesian products

DOI10.1002/jgt.22744arXiv2007.15504OpenAlexW3204776668MaRDI QIDQ6057645

Kirsti Kuenzel, Douglas F. Rall, Boštjan Brešar

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

digraphpackingCartesian productdominationdirect product

Mathematics Subject Classification ID

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

Related Items (2)

Injective coloring of graphs revisited ⋮ Orientable domination in product-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved inequality related to Vizing's conjecture
• On graphs having domination number half their order
• Relations between packing and covering numbers of a tree
• The square of a chordal graph
• An inequality related to Vizing's conjecture
• Complexity aspects of the Helly property: graphs and hypergraphs
• An improved bound in Vizing's conjecture
• Packing and domination parameters in digraphs
• Efficient closed domination in digraph products
• Normal hypergraphs and the perfect graph conjecture
• A new framework to approach Vizing's conjecture
• Vizing's conjecture: a survey and recent results
• On the domination of the products of graphs II: Trees
• Total Domination in Categorical Products of Graphs

This page was built for publication: Domination in digraphs and their direct and Cartesian products