With the rapid development of domination theory, the problem of edge domatic set partition of graphs has attracted much attention. Let be a nonempty graph, is said to be an edge domination set of if there exists an edge such that is adjacent to . is the set of all the edges of . And the maximum number of nonintersecting edge domination sets that it can be partitioned into is the edge domatic number of graph . The partition of edge domination set of Wheel graph with strong symmetry is the main research content, and the set edge domination number of wheel Graph is obtained by deductive reduction method, accordingly, the application of deductive reduction method in edge domatic set partition of special graph is realized.