A simple proof of the characterization of antipodal graphs (Q1322204)

The antipodal graph \(A(G)\) of a graph \(G\) is defined as the graph on the same vertex set as \(G\) with two vertices being adjacent in \(A(G)\) if the distance between them in \(G\) is the diameter of \(G\). As shown by R. Aravamudhan and B. Rajendran a graph \(G\) is an antipodal graph if and only if it is the antipodal graph of its complement \(\overline G\). In the paper a short and simple proof of this theorem is given.