Suppose your are given an antipodal graph $G=(V,E)$, that is, for every vertex $v\in V$ there is a unique maximally distant vertex $v'\in V$.

Under which condistions does the following holds:

If $\theta_2$ denotes the second-largest eigenvalue of $G$ (i.e., of its adjacency matrix), then for every $\theta_2$-eigenvector $u\in\Bbb R^V$ we have $u_v=-u_{v'}$ for all $v\in V$.

For example, is this true if $G$ is:

• walk-regular, (resp. vertex-transitive)
• 1-walk-regular (resp. vertex- and edge-transitive, or arc-transitive), or
• distance-regular (resp. distance-transitive).