AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenvalues. An eigenvalue of a graph is called main eigenvalue if it has an eigenvector such that the sum of whose entries is not equal to zero. In this paper, we show that there are exactly 25 connected integral graphs with exactly two main eigenvalues and index 3
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In t...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
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,…,vn and let d(vi) be the degree of the vertex vi. If d(G)...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractIt is shown that only a fraction of 2-Ω(n) of the graphs on n vertices have an integral spec...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
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...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In t...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
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,…,vn and let d(vi) be the degree of the vertex vi. If d(G)...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
AbstractA graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers....
AbstractIt is shown that only a fraction of 2-Ω(n) of the graphs on n vertices have an integral spec...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
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...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In t...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...