Some results on the resistance-distance spectrum
Some results on the resistance-distance spectrum
Received:August 16, 2022  Revised:January 03, 2023
DOI：

 Author Name Affiliation Address ZHOU Bo School of Mathematical Sciences, South China Normal University 华南师范大学 数学科学学院 Leyou Xu School of Mathematical Sciences, South China Normal University 华南师范大学 数学科学学院
Hits: 54
For vertices $u$ and $v$ in graph $G$, the resistance-distance $r_G(u,v)$ between $u$ and $v$ in $G$ is the effective resistance between them in an electrical network corresponding to $G$ when the resistance between any adjacent vertices is one unit. The resistance-distance eigenvalues of a connected graph $G$ are the eigenvalues of its resistance-distance matrix $R(G)=(r_G(u,v))_{u,v\in V(G)}$. We determine the graph that uniquely minimizes the largest resistance-distance eigenvalue over all connected graphs that are different from the complete graph and the complete graph with one edge deleted and over all connected graphs with fixed number of cut edges, respectively, and we also discuss properties for the smallest resistance-distance eigenvalue.