Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, where Rho >mu >lambda. In the case that G has just one non-main eigenvalue, we find necessary and sufficient spectral conditions on a vertex-deleted subgraph of G for G to be the cone over a strongly regular graph. Secondly, we determine the structure of G when just mu is non-main and the minimum degree of G is 1 + mu − lambda mu: such a graph is a cone over a strongly regular graph, or a graph derived from a symmetric 2-design, or a graph of one further type
AbstractIn this note we study some properties of the spectrum of a connected graph G with four diffe...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, wh...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
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...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at lea...
Let G be a connected triangle-free graph of order n>5 with μ∉{−1,0} as an eig...
AbstractIn this note we study some properties of the spectrum of a connected graph G with four diffe...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, wh...
Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum ρ, µ(k) , λ...
We investigate the problem of finding all the biregrular graphs with just three adjacency eigenvalue...
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...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
We survey results relating main eigenvalues and main angles to the structure of a graph. We provide ...
AbstractAn eigenvalue of a graph is main if it has an eigenvector, the sum of whose entries is not e...
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at lea...
Let G be a connected triangle-free graph of order n>5 with μ∉{−1,0} as an eig...
AbstractIn this note we study some properties of the spectrum of a connected graph G with four diffe...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...