A note on total and paired domination of Cartesian product graphs
From MaRDI portal
(Redirected from Publication:396841)
Abstract: A dominating set for a graph is a subset of such that any vertex not in has at least one neighbor in . The domination number is the size of a minimum dominating set in . Vizing's conjecture from 1968 states that for the Cartesian product of graphs and , , and Clark and Suen (2000) proved that . In this paper, we modify the approach of Clark and Suen to prove a variety of similar bounds related to total and paired domination, and also extend these bounds to the -Cartesian product of graphs through .
Recommendations
- Paired domination of Cartesian products of graphs
- Paired-domination of Cartesian products of graphs
- On total domination in the Cartesian product of graphs
- On the total domination number of Cartesian products of graphs
- Cartesian product graphs and \(k\)-tuple total domination
- Total domination of Cartesian products of graphs
- Total \(k\)-domination in Cartesian product graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- scientific article; zbMATH DE number 5917640
- On domatic and total domatic numbers of Cartesian products of graphs
Cites work
Cited in
(7)- scientific article; zbMATH DE number 5917640 (Why is no real title available?)
- Total domination in generalized prisms and a new domination invariant
- Cartesian product graphs and \(k\)-tuple total domination
- 3-tuple total domination number of Rook's graphs
- Paired domination in graphs
- (Total) domination in prisms
- Integer domination of Cartesian product graphs
This page was built for publication: A note on total and paired domination of Cartesian product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396841)