Abstract
In this note, a lower bound for the second largest eigenvalue of the Laplacian matrix of a graph is given in terms of the second largest degree of the graph.
∗Supported by National Natural Science Foundation of China (Grant No. 19971086) and Doctoral Program Foundation of Higher Education of China
†Corresponding author, e-mail: [email protected]
∗Supported by National Natural Science Foundation of China (Grant No. 19971086) and Doctoral Program Foundation of Higher Education of China
†Corresponding author, e-mail: [email protected]
Notes
∗Supported by National Natural Science Foundation of China (Grant No. 19971086) and Doctoral Program Foundation of Higher Education of China
†Corresponding author, e-mail: [email protected]