AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one
AbstractIn this paper, we classify the connected non-bipartite integral graphs with spectral radius ...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Abstract. Let G be a connected simple graph. The relationship between the third smallest eigenvalue ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
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)...
AbstractIn this paper, we classify the connected non-bipartite integral graphs with spectral radius ...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non...
Abstract. Let G be a connected simple graph. The relationship between the third smallest eigenvalue ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
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)...
AbstractIn this paper, we classify the connected non-bipartite integral graphs with spectral radius ...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
We continue our investigation of graphs G for which the least eigenvalue ?(G) is minimal among the c...
DOI
Add to ORKG