AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of examples from conference graphs, projective planes, and certain quasi-symmetric designs
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
The parameter σ(G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at lea...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
The parameter σ(G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at lea...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractLet G be a simple graph, and let λb(G) the least eigenvalue of the signless Laplacian of the...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
The parameter σ(G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal...
DOI
Add to ORKG