Regular two-graphs on 36 vertices

DOI10.1016/0024-3795(95)00158-NzbMath0834.05009OpenAlexW2085453715MaRDI QIDQ1899427

Spence, Edward

Publication date: 31 March 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00158-n

zbMATH Keywords

algorithmstrongly regular graphsHadamard matricesHadamard designstwo-graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Classification of Hadamard matrices of order 24 and 28 ⋮ Saturated configuration and new large construction of equiangular lines ⋮ Graphs with constant \(\mu\) and \(\overline{\mu}\) ⋮ Signed graphs with two eigenvalues and vertex degree five ⋮ On triple systems and strongly regular graphs ⋮ Automorphisms of Higman graphs with \(\mu=6\) ⋮ Spreads in strongly regular graphs ⋮ Unnamed Item ⋮ On modular standard modules of association schemes ⋮ Two-graphs and NSSDs: an algebraic approach ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ A sensitive algorithm for detecting the inequivalence of Hadamard matrices ⋮ Unnamed Item ⋮ Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 ⋮ Three-class association schemes ⋮ Small regular graphs with four eigenvalues ⋮ Edge-symmetric semitriangular Higman graphs

Cites Work

• Regular 2-Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item