On graphs with three eigenvalues

DOI10.1016/S0012-365X(98)00084-3zbMath0956.05071MaRDI QIDQ1584351

Mikhail E. Muzychuk, Mikhail H. Klin

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesnon-standard graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (44)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ More on graphs with just three distinct eigenvalues ⋮ Biregular graphs with three eigenvalues ⋮ Hypercubes are determined by their distance spectra ⋮ On graphs with just three distinct eigenvalues ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On the distance spectrum of graphs ⋮ On regular graphs with four distinct eigenvalues ⋮ Laplacian eigenvectors and eigenvalues and almost equitable partitions ⋮ Graphs with few matching roots ⋮ Spectral results on graphs with regularity constraints ⋮ Spectral results on regular graphs with \((k,\tau)\)-regular sets ⋮ On 2-equitable graphs ⋮ The number of ideals of \(\mathbb{Z} [x\) containing \(x(x-\alpha)(x-\beta)\) with given index] ⋮ Enumeration of Seidel matrices ⋮ Equiangular lines in Euclidean spaces ⋮ Graphs with two main and two plain eigenvalues ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ Graphs whose certain polynomials have few distinct roots ⋮ On graphs with three distinct Laplacian eigenvalues ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Integral complete multipartite graphs ⋮ Characterization of graphs with an eigenvalue of large multiplicity ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Graphs with three distinct \(\alpha\)-eigenvalues ⋮ Integral complete multipartite graphs \(K_{a_{1}\cdot p_{1},a_{2}\cdot p_{2},\dots ,a_s\cdot p_s}\) with \(s=5,6\) ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Unnamed Item ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ Signed graphs with three eigenvalues: biregularity and beyond ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ Some results on overgraphs of a strongly regular graph ⋮ Open problems in the spectral theory of signed graphs ⋮ Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\) ⋮ A nonregular analogue of conference graphs ⋮ Some new aspects of main eigenvalues of graphs ⋮ Graphs with three distinct eigenvalues and largest eigenvalue less than 8 ⋮ Integral complete \(r\)-partite graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• Coherent algebras
• A directed graph version of strongly regular graphs
• Multiplicative designs II. Uniform normal and related structures
• Multiplicative cones - a family of three eigenvalue graphs
• Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
• Strongly regular graphs
• Line graphs, root systems, and elliptic geometry
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• Nonregular graphs with three eigenvalues
• Problems in algebraic combinatorics
• Coherent configurations. I
• Strongly regular graphs with strongly regular decomposition
• Exceptional graphs with smallest eigenvalue -2 and related problems
• On a combinatorial generalization of 27 lines associated with a cubic surface
• Research problems

This page was built for publication: On graphs with three eigenvalues