In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by Vadim G. Vizing (1968), and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then γ ( G ◻ H ) ≥ γ ( G ) γ ( H ) .
In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by Vadim G. Vizing (1968), and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then γ ( G ◻ H ) ≥ γ ( G ) γ ( H ) .
Source: Wikipedia "Vizing's conjecture" · CC BY-SA 4.0
Share this article: X · Bluesky