The least distance eigenvalue of the complements of graphs of diameter greater than three

Xu Chen, Yinfen Zhu, Guoping Wang

Suppose $G$ is a connected simple graph with the vertex set $V(G)=\{v_1,v_2,\cdots ,v_n\}$. Let $d_G(v_i,v_j)$ be the least distance between $v_i$ and $v_j$ in $G$. Then…