AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum among all connected graphs of fixed order and given number of cut vertices, and then obtain a lower bound for the least eigenvalue of a connected graph in terms of the number of cut vertices. During the discussion we also get some results for the spectral radius of a connected bipartite graph and its upper bound
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
We characterize graphs whose the least eigenvalue attains minimum among all connected graphs of ver...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radi...
AbstractLet U(n,k) be the set of unicyclic graphs with n vertices and k pendant vertices. In this pa...
AbstractLet G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are thos...
We characterize graphs whose the least eigenvalue attains minimum among all connected graphs of ver...
AbstractLet Tnc be the set of the complements of trees of order n. In this paper, we characterize th...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices ...
AbstractIn this paper, we identify within connected graphs of order n and size n+k (with 0⩽k⩽4 and n...
AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum am...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
AbstractThe problem of identifying those simple, undirected graphs with n vertices and k edges that ...
AbstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs...
DOI
Add to ORKG