%0 Journal Article %T Eccentric completion of a graph %J Communications in Combinatorics and Optimization %I Azarbaijan Shahid Madani University %Z 2538-2128 %A Raja, Manakkulam Rohith %A Mangam, Tabitha Agnes %A Naduvath, Sudev %D 2022 %\ 12/01/2022 %V 7 %N 2 %P 193-201 %! Eccentric completion of a graph %K Eccentricity %K eccentric graphs %K iterated eccentric graphs %K eccentric completion %R 10.22049/cco.2021.27079.1192 %X The eccentric graph $G_e$ of a graph $G$ is a derived graph with the vertex set same as that of $G$ and two vertices in $G_e$ 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. %U http://comb-opt.azaruniv.ac.ir/article_14265_08b4e4113d407f5f25883c3eccc49371.pdf