A note on total and paired domination of Cartesian product graphs

From MaRDI portal
(Redirected from Publication:396841)




Abstract: A dominating set D for a graph G is a subset of V(G) such that any vertex not in D has at least one neighbor in D. The domination number gamma(G) is the size of a minimum dominating set in G. Vizing's conjecture from 1968 states that for the Cartesian product of graphs G and H, gamma(G)gamma(H)leqgamma(GBoxH), and Clark and Suen (2000) proved that gamma(G)gamma(H)leq2gamma(GBoxH). 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 n-Cartesian product of graphs A1 through An.









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)