Distance regular graphs of diameter 3 and strongly regular graphs

DOI10.1016/0012-365X(84)90157-2zbMATH Open0538.05024OpenAlexW2009347102MaRDI QIDQ793040FDOQ793040

Authors: Andries E. Brouwer 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90157-2

Recommendations

• Distance regular covers of the complete graph
• Distance-regular graphs with \(b_ 2=1\) and antipodal covers
• Distance-regular antipodal covering graphs
• On strongly regular graphs with parameters \((k,0,2)\) and their antipodal double covers
• scientific article; zbMATH DE number 482045

zbMATH Keywords

association schemestrongly regular graphsdistance regular graphsgeneralized quadrangles

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Ovoids and fans in the generalized quadrangle Q(4,2)
• A generalization of Moore graphs of diameter two
• Polarities of G. Higman's symmetric design and a strongly regular graph on 176 vertices
• Distance-Regular Graphs with Diameter Three

Cited In (72)

• Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
• The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
• The cyclic edge-connectivity of strongly regular graphs
• Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
• Certain strongly regular Cayley graphs on \(F_{2^{2(2s+1)}}\) from cyclotomy
• On the spectrum of an extremal graph with four eigenvalues
• Grassmannian codes from paired difference sets
• Construction of strongly regular graphs having an automorphism group of composite order
• Properties of codes with two homogeneous weights
• The extendability of matchings in strongly regular graphs
• Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
• Point configurations that are asymmetric yet balanced
• Packings in real projective spaces
• Cyclotomic trace codes
• A family of partial geometric designs from three-class association schemes
• On graphs with just three distinct eigenvalues
• Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)
• A two-fold cover of strongly regular graphs with spreads and association schemes of class five
• Extremal 1-codes in distance-regular graphs of diameter 3
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
• Equiangular tight frames from group divisible designs
• Distance-regular graphs with or at least half the valency
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Note on the sum of the smallest and largest eigenvalues of a triangle-free graph
• On D. G. Higman's note on regular 3-graphs
• A new distance-regular graph of diameter 3 on 1024 vertices
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• Harmonic equiangular tight frames comprised of regular simplices
• There is no (75,32,10,16) strongly regular graph
• Geometric antipodal distance-regular graphs with a given smallest eigenvalue
• Quantum walks on generalized quadrangles
• Divisible design graphs
• There is no strongly regular graph with parameters \((460, 153, 32, 60)\)
• On the coset graph construction of distance-regular graphs
• A finiteness theorem for W-graphs
• The absolute bound for coherent configurations
• Polyphase equiangular tight frames and abelian generalized quadrangles
• Optimal and near optimal configurations on lattices and manifolds. Abstracts from the workshop held August 19--25, 2012.
• Tremain equiangular tight frames
• On a family of strongly regular graphs with \(\lambda = 1\)
• Non-existence of (76,30,8,14) strongly regular graph
• Disconnecting strongly regular graphs
• The chromatic index of strongly regular graphs
• Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
• On automorphism groups of \(\mathrm{AT}4(7, 9, r)\)-graphs and of their local subgraphs
• Hadamard equiangular tight frames
• Bordered Complex Hadamard Matrices and Strongly Regular Graphs
• Four-class skew-symmetric association schemes
• Strongly regular graphs with maximal energy
• Distance regular covers of the complete graph
• On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
• Equiangular tight frames that contain regular simplices
• The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
• Equiangular tight frames with centroidal symmetry
• Second neighbourhoods of strongly regular graphs
• Title not available (Why is that?)
• Another construction of edge-regular graphs with regular cliques
• On the automorphism group of an antipodal tight graph of diameter 4 with parameters \((5, 7, r)\)
• Ball packings with high chromatic numbers from strongly regular graphs
• DDR Graphs of Diameter Three
• On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph
• Merging the first and third classes in bipartite distance-regular graphs
• Strongly regular graphs with parameters \((37, 18, 8, 9)\) having nontrivial automorphisms
• Transitive distance-regular graphs from linear groups \(L(3,q), q = 2,3,4,5\)
• Partial geometric designs having circulant concurrence matrices
• Linear ternary codes of strongly regular signed graphs
• Deza graphs with parameters (v,k,k−2,a)
• Distance-regular graphs with a few \(q\)-distance eigenvalues
• On locally \(n \times n\) grid graphs
• Constructions and restrictions for balanced splittable Hadamard matrices
• Cyclotomic association schemes of broad classes and applications to the construction of combinatorial structures

This page was built for publication: Distance regular graphs of diameter 3 and strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793040)