Vizing's Conjecture for Almost All Pairs of Graphs

Aziz Contractor, Elliot Krop

For any graph $G=(V,E)$, a subset $S\subseteq V$ $dominates$ $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all…