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