Spectral graph theory examines the structural and dynamical properties of graphs by analysing the spectra of associated matrices such as the adjacency matrix, Laplacian, normalised Laplacian and ...
Let L = D - A be the Laplacian matrix of a graph G of order n. Let t k be the kth largest eigenvalue of L (k = 1,...,n). For the purpose of this month's problem, we call the number [1] R. Grone, R.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results