AbstractLet G be a graph on n vertices v1,…,vn and let d(vi) be the degree of the vertex vi. If d(G)=(d(v1),…,d(vn))⊤ is an eigenvector of the (0,1)-adjacency matrix A of G, i.e. A(G)d(G)=λd(G), then G is said to be λ-harmonic. In this paper all connected integral 3-harmonic graphs are determined. There are exactly 26 such graphs
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractLet G be a graph on n vertices v1,…,vn and let d(vi) be the degree of the vertex vi. If d(G)...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
AbstractLet G be a graph on n vertices v1,v2,…,vn and let d(vi) be the degree (= number of first nei...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper, we classify the connected non-bipartite integral graphs with spectral radius ...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be the eigenvalues of a (0,1)-adjacency m...
A graph G on n vertices v1, v2,..., vn is said to be harmonic if (d(v1), d(v2),..., d(vn)) t is an e...
AbstractIt is shown that only a fraction of 2-Ω(n) of the graphs on n vertices have an integral spec...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractLet G be a graph on n vertices v1,…,vn and let d(vi) be the degree of the vertex vi. If d(G)...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
AbstractLet G be a graph on n vertices v1,v2,…,vn and let d(vi) be the degree (= number of first nei...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractIn this paper, we classify the connected non-bipartite integral graphs with spectral radius ...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be the eigenvalues of a (0,1)-adjacency m...
A graph G on n vertices v1, v2,..., vn is said to be harmonic if (d(v1), d(v2),..., d(vn)) t is an e...
AbstractIt is shown that only a fraction of 2-Ω(n) of the graphs on n vertices have an integral spec...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractLet G a simple undirected graph with n ⩾ 2 vertices and let α0(G) ⩾ …, αn−1(G) be the eigenv...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...