A note on Vizing's conjecture
Combinatorics
2022-12-20 v1
Abstract
Let denote the domination number of graph . Let and be graphs and their Cartesian product. For define and call this set a -layer of . We prove the following special case of Vizing's conjecture. Let be a dominating set of . If there exist minimum dominating sets and of such that for every , the projection of to is contained in or , then .
Cite
@article{arxiv.2212.09571,
title = {A note on Vizing's conjecture},
author = {Simon Špacapan},
journal= {arXiv preprint arXiv:2212.09571},
year = {2022}
}