The minimum number of total independent partition sets of V ∪ E of graph G(V,E)is called the total chromatic number of G denoted by χt(G).If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one,then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G,denoted by χet(G).In this paper,we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order.