资讯

JSTOR Daily

The Change in the Least Eigenvalue of the Adjacency Matrix of a Graph Under Imbedding

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 ...