Domination number of Cartesian product of graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 101 === For a graph G, (G) is the domination number of G. Vizing [2] conjectured that gamma(G Box H) >= gamma(G)gamma(H) for any graph G and H, where G Box H is the Cartesian product of graphs G and H. Clark and Suen [1] proved that gamma(G Box H) >= gamma(G)g...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/45008939229221822272 |