The eccentric graph Ge of a graph G is a derived graph with the vertex set same as that of G and two vertices in Ge are adjacent if one of them is the eccentric vertex of the other. In this paper, the concepts of iterated eccentric graphs and eccentric completion of a graph are introduced and discussed.