F-average eccentric graphs.

The F-average eccentric graph AEF (G) of a graph G has the vertex set as in G and any two vertices u and V are adjacent in AEF (G) if either they are at a distance... different components while G is disconnected. A graph G is called a F -average eccentric graph if AEF (H) ≅ G for some graph H. The main aim of this paper is to find a necessary and sufficient condition for a graph to be a F-average eccentric graph. [ABSTRACT FROM AUTHOR]