AbstractLet λ(G) be the least eigenvalue of a graph G. A real number r has the induced subgraph property provided λ(G)<r implies G has an induced subgraph H with λ(H)=r. It is shown that the only numbers with the induced subgraph property are 0, −1, −2, and −2
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
AbstractIn this paper, we characterize the unique graph whose least eigenvalue achieves the minimum ...
AbstractLet λ(F) be the least eigenvalue of a finite graph F. The least limiting eigenvalue λ(G) of ...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
AbstractThe least eigenvalue of the 0-1 adjacency matrix of a graph is denoted λ G. In this paper al...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractLet G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) ...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs ...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractA graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph is...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
AbstractIn this paper, we characterize the unique graph whose least eigenvalue achieves the minimum ...
AbstractLet λ(F) be the least eigenvalue of a finite graph F. The least limiting eigenvalue λ(G) of ...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving t...
AbstractThe least eigenvalue of the 0-1 adjacency matrix of a graph is denoted λ G. In this paper al...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractLet G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) ...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs ...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractA graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph is...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
AbstractIn this paper, we characterize the unique graph whose least eigenvalue achieves the minimum ...
AbstractLet λ(F) be the least eigenvalue of a finite graph F. The least limiting eigenvalue λ(G) of ...
DOI
Add to ORKG