Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
From MaRDI portal
Publication:2042199
DOI10.1007/s00373-021-02296-8zbMath1469.05106arXiv2011.11935OpenAlexW3158572985MaRDI QIDQ2042199
Meng-Yue Cao, Jack H. Koolen, Qianqian Yang
Publication date: 28 July 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.11935
distance-regular graphsigned graphSeidel matrixsmallest adjacency eigenvalueHoffman graphsco-edge regular graph
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Lattices and convex bodies (number-theoretic aspects) (11H06) Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22) Extremal combinatorics (05D99)
Related Items (2)
Sesqui-regular graphs with fixed smallest eigenvalue ⋮ Spectral characterization of the complete graph removing a cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-regular graphs
- Biregular graphs with three eigenvalues
- A structure theory for graphs with fixed smallest eigenvalue
- The twisted Grassmann graph is the block graph of a design
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
- On the limit points of the smallest eigenvalues of regular graphs
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- There are only finitely many distance-regular graphs of fixed valency greater than two
- Graphs with least eigenvalue \(-2\): ten years on
- An application of Hoffman graphs for spectral characterizations of graphs
- Claw-free graphs. VI: Colouring
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Spectra of graphs
- The integrally representable trees of norm \(3\)
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- Characterizing distance-regularity of graphs by the spectrum
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Spectral characterization of the Hamming graphs
- Claw-free graphs. V. Global structure
- Polarities, quasi-symmetric designs, and Hamada's conjecture
- The spectra of the local graphs of the twisted Grassmann graphs
- Sorting in \(c \log n\) parallel steps
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Eigenvalues and expanders
- Line graphs, root systems, and elliptic geometry
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- Strongly regular graphs with smallest eigenvalue -m
- Nonregular graphs with three eigenvalues
- On a characterization of bilinear forms graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Equiangular lines and spherical codes in Euclidean space
- A generalization of a theorem of Hoffman
- On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- A characterization of Grassmann graphs
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- Claw-free graphs. VII. Quasi-line graphs
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
- On the order of regular graphs with fixed second largest eigenvalue
- A spectral version of the Moore problem for bipartite regular graphs
- On the integrability of strongly regular graphs
- Some observations on the smallest adjacency eigenvalue of a graph
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- A generalization of a theorem of Neumaier
- Claw-free graphs. I: Orientable prismatic graphs
- Diameter bounds for geometric distance-regular graphs
- On the sizes of expander graphs and minimum distances of graph codes
- Claw-free graphs. II: Non-orientable prismatic graphs
- Equiangular lines
- A new family of distance-regular graphs with unbounded diameter
- Disconnecting strongly regular graphs
- Hoffman's ratio bound
- Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
- On fat Hoffman graphs with smallest eigenvalue at least -3
- Fat Hoffman graphs with smallest eigenvalue at least −1 − τ
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Low-dimensional lattices V. Integral coordinates for integral lattices
- Expander graphs and their applications
- A proof of Alon’s second eigenvalue conjecture and related problems
- On graphs with the smallest eigenvalue at least −1 − √2, part I
- Generalized line graphs
- Exceptional graphs with smallest eigenvalue -2 and related problems
- On graphs with the smallest eigenvalue at least −1 − √2, Part II
- Open problems in the spectral theory of signed graphs
- On graphs with the smallest eigenvalue at least −1 − √2, part III
- Problems on Graphs with Fixed Smallest Eigenvalue
- Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝
This page was built for publication: Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
