Distance regular graphs of diameter 3 and strongly regular graphs

From MaRDI portal
Revision as of 12:05, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:793040

DOI10.1016/0012-365X(84)90157-2zbMath0538.05024OpenAlexW2009347102MaRDI QIDQ793040

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




Related Items (67)

Non-existence of (76,30,8,14) strongly regular graphCyclotomic association schemes of broad classes and applications to the construction of combinatorial structuresOn graphs with just three distinct eigenvaluesDisconnecting strongly regular graphsNote on the sum of the smallest and largest eigenvalues of a triangle-free graphEquiangular tight frames that contain regular simplicesOptimal and near optimal configurations on lattices and manifolds. Abstracts from the workshop held August 19--25, 2012.On the coset graph construction of distance-regular graphsTransitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphsDistance-regular graphs of diameter 3 having eigenvalue \(-1\)Hadamard equiangular tight framesTremain equiangular tight framesDistance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)Quantum walks on generalized quadranglesOn automorphism groups of \(\mathrm{AT}4(7, 9, r)\)-graphs and of their local subgraphsEquiangular tight frames from group divisible designsThe extendability of matchings in strongly regular graphsLinear ternary codes of strongly regular signed graphsEquiangular tight frames with centroidal symmetryA Family of Partial Geometric Designs from Three-Class Association SchemesDeza graphs with parameters (v,k,k−2,a)Partial geometric designs having circulant concurrence matricesDistance-regular graphs with a few \(q\)-distance eigenvaluesDivisible design graphsFour-class skew-symmetric association schemesConstructions and restrictions for balanced splittable Hadamard matricesCertain strongly regular Cayley graphs on \(F_{2^{2(2s+1)}}\) from cyclotomyProperties of codes with two homogeneous weightsStrongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphismsThere Is No Strongly Regular Graph with Parameters (460, 153, 32, 60)Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphsThe absolute bound for coherent configurationsOn a family of strongly regular graphs with \(\lambda = 1\)Distance-regular graphs with or at least half the valencyGrassmannian codes from paired difference setsBordered Complex Hadamard Matrices and Strongly Regular GraphsStrongly regular graphs with maximal energySecond neighbourhoods of strongly regular graphsBall packings with high chromatic numbers from strongly regular graphsThe cyclic edge-connectivity of strongly regular graphsDistance regular covers of the complete graphCyclotomic trace codesPoint configurations that are asymmetric yet balancedQuasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometryPackings in Real Projective SpacesHarmonic equiangular tight frames comprised of regular simplicesOn the spectrum of an extremal graph with four eigenvaluesThere is no (75,32,10,16) strongly regular graphA two-fold cover of strongly regular graphs with spreads and association schemes of class fiveGeometric antipodal distance-regular graphs with a given smallest eigenvalueOn strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graphThe chromatic index of strongly regular graphsOn the automorphism group of an antipodal tight graph of diameter 4 with parameters \((5, 7, r)\)A finiteness theorem for W-graphsOn a conjecture of Brouwer involving the connectivity of strongly regular graphsAnother construction of edge-regular graphs with regular cliquesThe spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regularA new distance-regular graph of diameter 3 on 1024 verticesMerging the first and third classes in bipartite distance-regular graphsPolyphase equiangular tight frames and abelian generalized quadranglesEnumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism groupOn the \(p\)-ranks of the adjacency matrices of distance-regular graphsConstruction of strongly regular graphs having an automorphism group of composite orderHoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association SchemesThe nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)



Cites Work


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