DOIAbstract
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is described. It is shown that each minimal forbidden graph has at most 10 vertices and the bound is the best possible
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is described. It is shown that each minimal forbidden graph has at most 10 vertices and the bound is the best possible
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Suppose a graph G have n vertices, m edges, and t triangles. Letting n (G) be the largest eigenvalue...
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
In this paper, a characterization of the family of sigraphs represented by Dn for all n is proved. T...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Suppose a graph G have n vertices, m edges, and t triangles. Letting n (G) be the largest eigenvalue...
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
In this paper, a characterization of the family of sigraphs represented by Dn for all n is proved. T...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
Suppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest eigenvalue...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
Add to ORKG