In a connected graph G, the distance between two vertices of G is length shortest path these vertices. The eccentricity vertex u in largest and any other G. total-eccentricity index ?(G) sum eccentricities all this paper, we find extremal trees, unicyclic bicyclic graphs with respect to index. Moreover, conjugated trees