Bounds on the $\alpha$-distance spectrum of graphs

Yang Yang, Lizhu Sun, Changjiang Bu

For a simple, undirected and connected graph $G$, $D_{\alpha }(G)=\alpha Tr(G)+(1-\alpha )D(G)$ is called the $\alpha$-distance matrix of $G$, where $\alpha \in [0,1]$, $D(G)$ is the distance matrix of $G$,…