Total domination of Cartesian products of graphs
From MaRDI portal
Recommendations
Cited in
(26)- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- On total domination in the Cartesian product of graphs
- Domination and upper domination of direct product graphs
- Total \(k\)-domination in Cartesian product graphs
- Graph products and integer domination
- Tightness of domination inequalities for direct product graphs
- Power domination in cubic graphs and Cartesian products
- Characterizing Cartesian fixers and multipliers
- A domination algorithm for generalized Cartesian products
- Paired domination of Cartesian products of graphs
- scientific article; zbMATH DE number 2186022 (Why is no real title available?)
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
- Total domination in the Cartesian product of a graph and K₂ or C_n
- Location-2-Domination for Product of Graphs
- A note on total and paired domination of Cartesian product graphs
- scientific article; zbMATH DE number 1124600 (Why is no real title available?)
- Total weight choosability of Cartesian product of graphs
- scientific article; zbMATH DE number 2109312 (Why is no real title available?)
- Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
- (Total) domination in prisms
- Total Domination in Categorical Products of Graphs
- Some results on total domination in direct products of graphs
- Domination number of modular product graphs
- Lower bounds for the domination number and the total domination number of direct product graphs
- On the upper total domination number of Cartesian products of graphs
- On the total domination number of cross products of graphs
This page was built for publication: Total domination of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444066)
