definition clarification in graph theory I was studying about **_Almost Self-Centered Graphs (ASC)_**. ASC graphs are introduced as the graphs with exactly two non-central vertices. Of course, the remaining two vertices are diametrical. My doubt is that if we have two non-central vertices _x_ and _y_ , does it mean that _d(x,y) = ecc(x) = ecc(y)_. I am quite confused. Tried few examples and I found it to be true. If I am wrong please rectify me. thanks a lot for help :)

This is true.

Suppose $r$ is the radius of the graph. Then any vertex except for $x$ and $y$ has eccentricity $r$, and $x$ and $y$ have eccentricity greater than $r$.

There must be some vertex $z$ with distance $d(x,z) = \operatorname{ecc}(x)$, by the definition of eccentricity. However, $z$ must in fact be $y$, because, were $z$ not $y$, $\operatorname{ecc}(z) < \operatorname{ecc}(x) = d(x,z)$, a contradiction. Therefore, $d(x,y) = \operatorname{ecc}(x)$.

The same logic holds for $y$, proving the theorem.