AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not equal to zero. Extending previous results of Hagos and Hou et al. we obtain two conditions for graphs with given main eigenvalues. All trees and connected unicyclic graphs with exactly two main eigenvalues were characterized by Hou et al. Extending their results, we determine all bicyclic connected graphs with exactly two main eigenvalues
Submitted by R.A. Brualdi An eigenvalue of a graph G is called main eigenvalue if it has an eigenvec...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
AbstractAn eigenvalue of a graph G is called main if there is an associated eigenvector not orthogon...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
summary:An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvecto...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
A (κ, τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such th...
AbstractA (κ,τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph ...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
Submitted by R.A. Brualdi An eigenvalue of a graph G is called main eigenvalue if it has an eigenvec...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eige...
AbstractAn eigenvalue of a graph G is called main if there is an associated eigenvector not orthogon...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
summary:An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvecto...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
A (κ, τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such th...
AbstractA (κ,τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph ...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
Submitted by R.A. Brualdi An eigenvalue of a graph G is called main eigenvalue if it has an eigenvec...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
DOI
Add to ORKG