AbstractIf r⩾τ12+τ-12 (τ is the golden mean), then there exists a sequence of graphs whose kth largest eigenvalues converge to r. If r⩽ -(τcase:12+τcase:-12), then there exist a sequence of graphs whose kth smallest eigenvalues converge to r
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
summary:The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffm...
AbstractGiven a graph G, let λ (G) denote the largest eigenvalue of the adjacency matrix of G. We pr...
AbstractThe study of limit points of eigenvalues of adjacency matrices of graphs was initiated by Ho...
AbstractLet G be a graph on n vertices. Denote by L(G) the Laplacian matrix of G. It is easy to see ...
AbstractLet G be a simple graph. In this paper, we obtain a sequence (bp)p=1∞ of upper bounds on the...
We prove that for each $d \geq 3$ the set of all limit points of the second largest eigenvalue of gr...
Let μ1 (G) ≥ ... ≥ μn (G) be the eigenvalues of the adjacency matrix of a graph G of order n, and Ḡ ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
summary:The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffm...
AbstractGiven a graph G, let λ (G) denote the largest eigenvalue of the adjacency matrix of G. We pr...
AbstractThe study of limit points of eigenvalues of adjacency matrices of graphs was initiated by Ho...
AbstractLet G be a graph on n vertices. Denote by L(G) the Laplacian matrix of G. It is easy to see ...
AbstractLet G be a simple graph. In this paper, we obtain a sequence (bp)p=1∞ of upper bounds on the...
We prove that for each $d \geq 3$ the set of all limit points of the second largest eigenvalue of gr...
Let μ1 (G) ≥ ... ≥ μn (G) be the eigenvalues of the adjacency matrix of a graph G of order n, and Ḡ ...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
AbstractWe improve some recent results on graph eigenvalues. In particular, we prove that if G is a ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
summary:Lower and upper bounds are obtained for the clique number $\omega (G)$ and the independence ...
For a simple, undirected graph G(n), let lambda(i)(G(n)) be the ith largest eigenvalue of G(n). This...
DOI
Add to ORKG