AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed 1 and all connected graphs with exactly one eigenvalue less than −1 are characterized. Besides, all minimal graphs with exactly two eigenvalues less than −1 are determined
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs ...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
Let G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs ...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
DOI
Add to ORKG