Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
From MaRDI portal
co-edge regular graphdistance-regular graphHoffman graphsSeidel matrixsigned graphsmallest adjacency eigenvalue
Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Extremal combinatorics (05D99) Association schemes, strongly regular graphs (05E30) Lattices and convex bodies (number-theoretic aspects) (11H06)
Abstract: We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory related to Hoffman graphs and the applications of Hoffman graphs to graphs with fixed smallest eigenvalue and large minimal valency; (ii) recent results on distance-regular graphs and co-edge regular graphs with fixed smallest eigenvalue and the characterizations of certain families of distance-regular graphs. At the end of the survey, we also discuss signed graphs with fixed smallest eigenvalue and present some new findings.
Recommendations
- A structure theory for graphs with fixed smallest eigenvalue
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On graphs whose least eigenvalue is greater than –2
- Signed analogue of line graphs and their smallest eigenvalues
Cites work
- A characterization of Grassmann graphs
- A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
- A generalization of a theorem of Hoffman
- A generalization of a theorem of Neumaier
- A new family of distance-regular graphs with unbounded diameter
- A proof of Alon’s second eigenvalue conjecture and related problems
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- A spectral version of the Moore problem for bipartite regular graphs
- A structure theory for graphs with fixed smallest eigenvalue
- An application of Hoffman graphs for spectral characterizations of graphs
- Biregular graphs with three eigenvalues
- Characterizing distance-regularity of graphs by the spectrum
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Claw-free graphs. V. Global structure
- Claw-free graphs. VI: Colouring
- Claw-free graphs. VII. Quasi-line graphs
- Diameter bounds for geometric distance-regular graphs
- Disconnecting strongly regular graphs
- Distance-regular graphs
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Eigenvalues and expanders
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Equiangular lines
- Equiangular lines and spherical codes in Euclidean space
- Erdős-Ko-Rado theorems. Algebraic approaches
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander graphs and their applications
- Explicit construction of linear sized tolerant networks
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Fat Hoffman graphs with smallest eigenvalue at least -1 -
- Fat Hoffman graphs with smallest eigenvalue greater than -3
- Generalized line graphs
- Graphs with least eigenvalue -2: ten years on
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Hoffman's ratio bound
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1303108 (Why is no real title available?)
- scientific article; zbMATH DE number 563236 (Why is no real title available?)
- scientific article; zbMATH DE number 599949 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- scientific article; zbMATH DE number 3419170 (Why is no real title available?)
- scientific article; zbMATH DE number 3102314 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Line graphs, root systems, and elliptic geometry
- Low-dimensional lattices V. Integral coordinates for integral lattices
- Maximizing the order of a regular graph of given valency and second eigenvalue
- Nonregular graphs with three eigenvalues
- On a characterization of bilinear forms graphs
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- On fat Hoffman graphs with smallest eigenvalue at least -3
- On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
- On graphs whose least eigenvalue exceeds -1-2
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- On graphs with the smallest eigenvalue at least -1 - 2. II
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- On graphs with the smallest eigenvalue at least −1 − √2, part I
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
- On the integrability of strongly regular graphs
- On the limit points of the smallest eigenvalues of regular graphs
- On the order of regular graphs with fixed second largest eigenvalue
- On the sizes of expander graphs and minimum distances of graph codes
- Open problems in the spectral theory of signed graphs
- Polarities, quasi-symmetric designs, and Hamada's conjecture
- Problems on Graphs with Fixed Smallest Eigenvalue
- Pseudo-random graphs
- Ramanujan graphs
- Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝
- Some observations on the smallest adjacency eigenvalue of a graph
- Sorting in \(c \log n\) parallel steps
- Spectra of graphs
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- Spectral characterization of the Hamming graphs
- Spectral radius of graphs
- Strongly regular graphs with smallest eigenvalue -m
- The integrally representable trees of norm 3
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- The spectra of the local graphs of the twisted Grassmann graphs
- The structure of claw-free graphs
- The subconstituent algebra of an association scheme. I
- The subconstituent algebra of an association scheme. III
- The twisted Grassmann graph is the block graph of a design
- There are only finitely many distance-regular graphs of fixed valency greater than two
Cited in
(5)
This page was built for publication: Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2042199)
