Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...
The spectral graph theory is the study of the properties of a graph in relation ship to the characteristic polynomial, eigenvalues and eigenvectors of its adjacency matrix or Laplacian matrix. For ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback