www.elsevier.com/locate/aml An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular. In this work, all connected unicyclic graphs with exactly two main eigenvalues are determined. c ○ 2006 Elsevier Ltd. All rights reserved
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. An eigenvalue of a graph is ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
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...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
summary:An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvecto...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
Submitted by R.A. Brualdi An eigenvalue of a graph G is called main eigenvalue if it has an eigenvec...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
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 ...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. An eigenvalue of a graph is ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
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...
Abstract. A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalu...
AbstractThis paper presents a variety of results on graph spectra. The number of main eigenvalues of...
summary:An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvecto...
AbstractA graph is called integral if the spectrum of its adjacency matrix has only integral eigenva...
Submitted by R.A. Brualdi An eigenvalue of a graph G is called main eigenvalue if it has an eigenvec...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
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 ...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. An eigenvalue of a graph is ...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
Add to ORKG