View Original: | Star product domination.svg (378x378) | |||
Download: | Original | Medium | Small | Thumb |
Courtesy of: | commons.wikimedia.org | More Like This | ||
Keywords: Star product domination.svg dominating set of five vertices in the Cartesian product of graphs K<sub>1 4</sub> —» K<sub>1 4</sub> Vizing's conjecture states that the domination number of a product is at least the product of the domination number of the factors but examples of this form show that this bound can be very far from tight in some graphs own David Eppstein 2009-11-18 Graph products Files by User David Eppstein from en wikipedia Graphs with 25 vertices Graph coloring; vertex |