English

A note on Vizing's conjecture

Combinatorics 2022-12-20 v1

Abstract

Let γ(G)\gamma(G) denote the domination number of graph GG. Let GG and HH be graphs and GHG\Box H their Cartesian product. For hV(H)h\in V(H) define Gh={(g,h)gV(G)}G_h=\{(g,h)\,|\,g\in V(G)\} and call this set a GG-layer of GHG\Box H. We prove the following special case of Vizing's conjecture. Let DD be a dominating set of GHG\Box H. If there exist minimum dominating sets D1D_1 and D2D_2 of GG such that for every hV(H)h\in V(H), the projection of DGhD\cap G_h to GG is contained in D1D_1 or D2D_2, then Dγ(G)γ(H)|D|\geq \gamma(G)\gamma(H).

Keywords

Cite

@article{arxiv.2212.09571,
  title  = {A note on Vizing's conjecture},
  author = {Simon Špacapan},
  journal= {arXiv preprint arXiv:2212.09571},
  year   = {2022}
}
R2 v1 2026-06-28T07:42:31.548Z