A note on Vizing's conjecture
Abstract
Let γ(G) denote the domination number of graph G. Let G and H be graphs and G H their Cartesian product. For h∈ V(H) define Gh=\(g,h)\,|\,g∈ V(G)\ and call this set a G-layer of G H. We prove the following special case of Vizing's conjecture. Let D be a dominating set of G H. If there exist minimum dominating sets D1 and D2 of G such that for every h∈ V(H), the projection of D Gh to G is contained in D1 or D2, then |D|≥ γ(G)γ(H).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.