Distance regular graphs of diameter 3 and strongly regular graphs
From MaRDI portal
Publication:793040
DOI10.1016/0012-365X(84)90157-2zbMath0538.05024OpenAlexW2009347102MaRDI QIDQ793040
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
Non-existence of (76,30,8,14) strongly regular graph, Cyclotomic association schemes of broad classes and applications to the construction of combinatorial structures, On graphs with just three distinct eigenvalues, Disconnecting strongly regular graphs, Note on the sum of the smallest and largest eigenvalues of a triangle-free graph, Equiangular tight frames that contain regular simplices, Optimal 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 graphs, Transitive 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 graphs, Distance-regular graphs of diameter 3 having eigenvalue \(-1\), Hadamard equiangular tight frames, Tremain equiangular tight frames, Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\), Quantum walks on generalized quadrangles, On automorphism groups of \(\mathrm{AT}4(7, 9, r)\)-graphs and of their local subgraphs, Equiangular tight frames from group divisible designs, The extendability of matchings in strongly regular graphs, Linear ternary codes of strongly regular signed graphs, Equiangular tight frames with centroidal symmetry, A Family of Partial Geometric Designs from Three-Class Association Schemes, Deza graphs with parameters (v,k,k−2,a), Partial geometric designs having circulant concurrence matrices, Distance-regular graphs with a few \(q\)-distance eigenvalues, Divisible design graphs, Four-class skew-symmetric association schemes, Constructions and restrictions for balanced splittable Hadamard matrices, Certain strongly regular Cayley graphs on \(F_{2^{2(2s+1)}}\) from cyclotomy, Properties of codes with two homogeneous weights, Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms, There 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 graphs, The absolute bound for coherent configurations, On a family of strongly regular graphs with \(\lambda = 1\), Distance-regular graphs with or at least half the valency, Grassmannian codes from paired difference sets, Bordered Complex Hadamard Matrices and Strongly Regular Graphs, Strongly regular graphs with maximal energy, Second neighbourhoods of strongly regular graphs, Ball packings with high chromatic numbers from strongly regular graphs, The cyclic edge-connectivity of strongly regular graphs, Distance regular covers of the complete graph, Cyclotomic trace codes, Point configurations that are asymmetric yet balanced, Quasi-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 geometry, Packings in Real Projective Spaces, Harmonic equiangular tight frames comprised of regular simplices, On the spectrum of an extremal graph with four eigenvalues, There is no (75,32,10,16) strongly regular graph, A two-fold cover of strongly regular graphs with spreads and association schemes of class five, Geometric antipodal distance-regular graphs with a given smallest eigenvalue, On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph, The chromatic index of strongly regular graphs, On the automorphism group of an antipodal tight graph of diameter 4 with parameters \((5, 7, r)\), A finiteness theorem for W-graphs, On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Another construction of edge-regular graphs with regular cliques, The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular, A new distance-regular graph of diameter 3 on 1024 vertices, Merging the first and third classes in bipartite distance-regular graphs, Polyphase equiangular tight frames and abelian generalized quadrangles, Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group, On the \(p\)-ranks of the adjacency matrices of distance-regular graphs, Construction of strongly regular graphs having an automorphism group of composite order, Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes, The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
Cites Work
