Orientable domination in product-like graphs
From MaRDI portal
Publication:2109114
DOI10.1016/J.DAM.2022.11.003OpenAlexW4310507046MaRDI QIDQ2109114FDOQ2109114
Douglas F. Rall, Sarah E. Anderson, Sandi Klavžar, Kirsti Kuenzel, Boštjan Brešar
Publication date: 20 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.02395
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the domination number of a digraph
- On a Problem in Graph Theory
- Vizing's conjecture: a survey and recent results
- Relations between packing and covering numbers of a tree
- Directed domination in oriented graphs
- Dominating sets in \(k\)-majority tournaments.
- On the bounded domination number of tournaments
- Packing and domination parameters in digraphs
- On a Problem of Schütte and Erdös
- Domination in digraphs and their direct and Cartesian products
- Domination and fractional domination in digraphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- Domination related parameters in the generalized lexicographic product of graphs
- Domination in Digraphs
Cited In (3)
This page was built for publication: Orientable domination in product-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109114)