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
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In o...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
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....
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractAn eigenvalue of a graph G is called main if there is an associated eigenvector not orthogon...
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this pape...
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 all the eigenvalues of its adjacency matrix are integers. In t...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In o...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
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....
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractAn eigenvalue of a graph G is called main if there is an associated eigenvector not orthogon...
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this pape...
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 all the eigenvalues of its adjacency matrix are integers. In t...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In o...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
DOI
Add to ORKG