With the rapid development of domination theory, the problem of edge domatic set partition of graphs has attracted much attention. As G=(V，E), a nonempty graph, D⊆E is said to be an edge domination set of G. If ∀e∈E-D， there exists an edge e′∈D，so that e is adjacent to e′ and E(G) is the set of all the edges of G. The maximum number of nonintersecting edge domination sets that can be partitioned into is the edge domatic number d′(G) of graph G. The partition of edge domination set of Wheel graph W_n+1 with strong symmetry is the main research content, and the set edge domination number of Wheel graph W_n+1 is obtained by deductive reduction method. Accordingly, the application of deductive reduction method in edge domatic set partition of special graph is realized.