Abstract
The center of an F-graph contains at least two vertices, and the distance between any two central vertices is equal to the radius. In this short note, we describe one way of constructing these graphs.
Subject
Applied Mathematics,Modeling and Simulation,General Computer Science,Theoretical Computer Science
Reference7 articles.
1. Constant work-space algorithms for facility location problems;Binay;Discret. Appl. Math.,2020
2. Facility location problems;Buckley;Coll. Math. J.,1987
3. Graphs with all diametral paths through distant central nodes
4. Introductory Graph Theory with Aplications;Buckley,2013
5. Distance in Graphs;Buckley,1990