A note on total and paired domination of Cartesian product graphs

zbMATH Open1298.05245arXiv1109.2174MaRDI QIDQ396841FDOQ396841

Authors: K. Choudhary, Susan Margulies, Illya V. Hicks 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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 $A^1$ through $A^n$.

Full work available at URL: https://arxiv.org/abs/1109.2174

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

domination numberdominating setVizing's conjecture

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Vizing's conjecture: a survey and recent results
• Paired-domination of Cartesian products of graphs
• Title not available (Why is that?)
• An inequality related to Vizing's conjecture
• Paired domination of Cartesian products of graphs

Cited In (7)

• Cartesian product graphs and \(k\)-tuple total domination
• Total domination in generalized prisms and a new domination invariant
• Paired domination in graphs
• 3-tuple total domination number of Rook's graphs
• (Total) domination in prisms
• Integer domination of Cartesian product graphs
• Title not available (Why is that?)

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)