Strongly regular graphs with smallest eigenvalue -m
From MaRDI portal
Publication:1257906
DOI10.1007/BF01222774zbMath0407.05043OpenAlexW1966550638MaRDI QIDQ1257906
Publication date: 1980
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01222774
Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (56)
A generalization of a theorem of Neumaier ⋮ Biregular graphs with three eigenvalues ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ Disconnecting strongly regular graphs ⋮ Numerical invariants of strongly regular graphs ⋮ On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) ⋮ A remark on partial linear spaces of girth 5 with an application to strongly regular graphs ⋮ Distance-regular graphs of diameter 3 having eigenvalue \(-1\) ⋮ Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\) ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ Antipodal covers of strongly regular graphs ⋮ On graphs in which the neighborhoods of vertices are pseudogeometric graphs for \(pG_{s-2}(s,t)\) ⋮ On strongly regular graphs with eigenvalue 2 and their extensions ⋮ Parameters of semilinear Higman graphs ⋮ On strongly regular graphs with eigenvalue 3 and their extensions ⋮ Diameter bounds for geometric distance-regular graphs ⋮ Cliques and claws in edge-transitive strongly regular graphs ⋮ Geometric distance-regular graphs without 4-claws ⋮ Restrictions on classical distance-regular graphs ⋮ Distances, graphs and designs ⋮ Sesqui-regular graphs with fixed smallest eigenvalue ⋮ Unnamed Item ⋮ On regular graphs equienergetic with their complements ⋮ On the nonexistence of pseudo-generalized quadrangles ⋮ The maximum cut problem on blow-ups of multiprojective spaces ⋮ On triple systems and strongly regular graphs ⋮ Unnamed Item ⋮ Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier–Hermite polynomials ⋮ Finite linear spaces with a regularity condition on the transversals of two secant lines ⋮ Exceptional strongly regular graphs with eigenvalue 3 ⋮ Homomorphisms of strongly regular graphs ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ Cores of geometric graphs ⋮ On the order of regular graphs with fixed second largest eigenvalue ⋮ Weakly Hadamard diagonalizable graphs ⋮ Two characterizations of the grid graphs ⋮ Spreads in strongly regular graphs ⋮ Exceptional strongly regular graphs with eigenvalue 3 ⋮ The cyclic edge-connectivity of strongly regular graphs ⋮ Conditions for the parameters of the block graph of quasi-symmetric designs ⋮ Random strongly regular graphs? ⋮ Random strongly regular graphs? ⋮ On the spectral gap and the automorphism group of distance-regular graphs ⋮ On the integrability of strongly regular graphs ⋮ Geometric antipodal distance-regular graphs with a given smallest eigenvalue ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Developments on spectral characterizations of graphs ⋮ Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs ⋮ State transfer in strongly regular graphs with an edge perturbation ⋮ Strongly regular graphs with \(\lambda\) = 1 ⋮ The chromatic index of strongly regular graphs ⋮ Distance-regular graphs without 4-claws ⋮ Graphes liés aux espaces polaires ⋮ Developments in the theory of graph spectra ⋮ On a conjecture of Brouwer involving the connectivity of strongly regular graphs ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial
Cites Work
- Quasi-residual 2-designs, 1,5-designs, and strongly regular multigraphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Strongly regular graphs
- Balanced incomplete block designs and related designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Strongly regular graphs, partial geometries and partially balanced designs
- Finite nets. II: Uniqueness and imbedding
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strongly regular graphs with smallest eigenvalue -m
