On the Graph Corresponding to Center of Distances of Metric Space
The center of distances $C(Y)$ of a metric space $(Y,ρ)$ is the set of all $t\geq 0$ for which the equation $ρ(y,p)=t $ has a solution for each point $p\in Y$. We say that a simple graph $CG_Y$ is the central graph of a metric space $(Y,ρ)$ if $Y$ is the vertex set of $CG_Y$ and distinct vertices $x,y\in Y$ are adjacent if and only if $ρ(x,y)\in C(Y)$. We prove the inequality $|E(CG_Y)| \geq \left\lceil \frac{1}{2}|Y| \right\rceil $ for all finite metric spaces $(Y,ρ)$ with $|Y|\geq 2$ and non-empty $CG_Y.$ It is also proved that the inequality $|E(CG_X)| \geq |X|-1 $ holds for each finite ultrametric space $(X,d)$. The central graphs of metric spaces $(Y,ρ)$ and ultrametric spaces $(X,d)$ satisfying $|E(CG_Y)|=\left\lceil \frac{1}{2}|Y| \right\rceil $ and, respectively, $|E(CG_X)|=|X|-1 $ are described up to graph isomorphism.