We call a graph self-centered if all of its vertices are in its center. There are several. classes of such graphs; cycles
complete graphs
disconnected graphs complete n-partite graphs. It is evident that a graph is self-centered if and only if its diameter and radius are equal. In this paper we discuss some properties of self-centered graph
i. c. Th 1-5
and we give the construction for some self-centered graphs.