Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 139936 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1510634 (Why is no real title available?)
- scientific article; zbMATH DE number 1792590 (Why is no real title available?)
- scientific article; zbMATH DE number 2108130 (Why is no real title available?)
- scientific article; zbMATH DE number 1398657 (Why is no real title available?)
- scientific article; zbMATH DE number 2192181 (Why is no real title available?)
- A note on domination parameters of the conjunction of two special graphs
- Associative graph products and their independence, domination and coloring numbers
- Domination number of the cross product of paths
- On a Vizing-like conjecture for direct product graphs
- On the domination number of cross products of graphs
- Paired-domination in graphs
- Smallest independent dominating sets in Kronecker products of cycles
- Some results on total domination in direct products of graphs
- Total Domination in Categorical Products of Graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
Cited in
(21)- Domination number of modular product graphs
- On independent domination in direct products
- On the power domination number of graph products
- Domination and upper domination of direct product graphs
- On the domination number of cross products of graphs
- Graph products and integer domination. II
- Tightness of domination inequalities for direct product graphs
- Bounds on the domination number and the metric dimension of co-normal product of graphs
- Unimodality and monotonic portions of certain domination polynomials
- Domination in direct products of complete graphs
- On well-dominated graphs
- On the roman domination in the lexicographic product of graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Some results on total domination in direct products of graphs
- Lower bounds for the domination number and the total domination number of direct product graphs
- Connectivity and other invariants of generalized products of graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Idomatic partitions of direct products of complete graphs
- Dominating sets in intersection graphs of finite groups
- Paired domination in graphs
- Domination-related parameters in rooted product graphs
This page was built for publication: Dominating direct products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879339)
