GRAPHS WITH EQUIDISTANT CENTRAL NODES

ABSTRACT. An F-graph is a graph G whose center C (G) contains at least two nodes, and the distance between any two nodes of C(G) equals the radius of G. In this paper we study properties of these and describe some of them