A parallel computation was built in high performance computing cluster(HPC). In the Cluster, each natural number less than or equal to vertices number of the graph has been tested with a cluster node. The minimal domination number (MDN) was worked out efficiently. In this study, taking W(3,n) Knodel graph for an example, the sharp bounds of the MDN has been gave out by parallel computation and a accuracy proof of MDN is provided.
展开▼
