The total graph T(G) of a graph G is a graph such that the vertex set of T(G) corresponds to the vertices and edges of G and two vertices are adjacent in T(G) if and only if their corresponding u_1 element are either adjacent or incident in G. The middle graph of connected graph G denoted by M(G) is the graph whose vertex set is V(G)∪E(G) where two vertices are adjacent if they are adjacent edges of G or one is a vertex of G and the other is an edge incident with it. In this article, we studied the fault tolerant geodetic number of total and middle graph of a graph.