We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which consists of 13 classes of specific graphs. These 13 classes hint that $c_{2}\in [1/2, \sqrt{2+\sqrt{5}}]$, where $c_2$ is the minimum real number $c$ for which every real number greater than $c$ is a limit point in the set of the second largest eigenvalues of the simple connected graphs. We leave it as a problem.Comment: 36 pages, 2 table
AbstractWe determine all nested split graphs (i.e. graphs having no induced subgraphs equal to 2K2,P...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractIt is shown that the second largest eigenvalue of the adjacency matrix of any d-regular grap...
Let $G$ be a simple connected graph and let $S_k(G)$ be the sum of the first $k$ largest signless La...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractWe determine all nested split graphs (i.e. graphs having no induced subgraphs equal to 2K2,P...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractThe main result is that if the smallest eigenvalue of a graph H exceeds a fixed number large...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractIt is shown that the second largest eigenvalue of the adjacency matrix of any d-regular grap...
Let $G$ be a simple connected graph and let $S_k(G)$ be the sum of the first $k$ largest signless La...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractWe determine all nested split graphs (i.e. graphs having no induced subgraphs equal to 2K2,P...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...