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
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenv...
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
International audienceWe characterize all graphs for which there are eigenvectors of the graph Lapla...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable parti...
In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integ...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenv...
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
Abstract. In this paper, an equivalent condition of a graph G with t (2 ≤ t ≤ n) distinct Laplacian ...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
International audienceWe characterize all graphs for which there are eigenvectors of the graph Lapla...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractSuppose a graph G have n vertices, m edges, and t triangles. Letting λn(G) be the largest ei...
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable parti...
In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integ...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenv...
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
DOI
Add to ORKG