AbstractA (κ,τ)-regular set is a subset of the vertices of a graph G, inducing a κ-regular subgraph such that every vertex not in the subset has τ neighbors in it. A main eigenvalue of the adjacency matrix A of a graph G has an eigenvector not orthogonal to the all-one vector j. For graphs with a (κ,τ)-regular set a necessary and sufficient condition for an eigenvalue be non-main is deduced and the main eigenvalues are characterized. These results are applied to the construction of infinite families of bidegreed graphs with two main eigenvalues and the same spectral radius (index) and some relations with strongly regular graphs are obtained. Finally, the determination of (κ,τ)-regular sets is analyzed
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, wh...
Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
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 ...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an e...
In this paper, relevant results about the determination of ( κ , τ )- regular sets, using the main ...
A vertex v ∈ V (G) is called λ-main if it belongs to a star set X ⊂ V (G) of the eigenvalue λ of a ...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
AbstractA subset of the vertex set of a graph G, W⊆V(G), is a (k,τ)-regular set if it induces a k-re...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, wh...
Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...
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 ...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
An eigenvalue of the adjacency matrix of a graph is said to be main if the all-1 vector is non-ortho...
A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an e...
In this paper, relevant results about the determination of ( κ , τ )- regular sets, using the main ...
A vertex v ∈ V (G) is called λ-main if it belongs to a star set X ⊂ V (G) of the eigenvalue λ of a ...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
AbstractA subset of the vertex set of a graph G, W⊆V(G), is a (k,τ)-regular set if it induces a k-re...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, wh...
Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called...
AbstractAn eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of w...