Paired-domination of Cartesian products of graphs
From MaRDI portal
(Redirected from Publication:5442178)
Recommendations
Cited in
(19)- Total domination versus paired-domination in regular graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Tightness of domination inequalities for direct product graphs
- 3-tuple total domination number of Rook's graphs
- Paired domination versus domination and packing number in graphs
- Disjoint paired-dominating sets in cubic graphs
- Total and paired domination numbers of toroidal meshes
- Graphs with maximum size and given paired-domination number
- scientific article; zbMATH DE number 5917640 (Why is no real title available?)
- Paired domination of Cartesian products of graphs
- Paired domination in graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- The paired domination number of the Cartesian products of paths with cycles
- Bounds on the 2-rainbow domination number of graphs
- A note on total and paired domination of Cartesian product graphs
- Cartesian product graphs and \(k\)-tuple total domination
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Well paired-dominated graphs
- Upper paired-domination in claw-free graphs
This page was built for publication: Paired-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 Q5442178)