Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
From MaRDI portal
Publication:1871382
zbMath1011.05063MaRDI QIDQ1871382
Mikhail H. Klin, L. K. Jørgensen
Publication date: 7 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122605
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items
Implementing Brouwer's database of strongly regular graphs ⋮ Automorphisms of strongly regular graphs with applications to partial difference sets ⋮ On bipartite distance-regular Cayley graphs with small diameter ⋮ Factorisations of sporadic simple groups. ⋮ Classification of partial difference sets in abelian groups of order \(4p^2\) ⋮ Restrictions on parameters of partial difference sets in nonabelian groups ⋮ Orbit matrices of Hadamard matrices and related codes ⋮ Switching codes and designs ⋮ The Hall-Janko graph and the Witt system \(W_{10}\) ⋮ Non-existence of partial difference sets in abelian groups of order \(8p^3\) ⋮ Strongly regular graphs with maximal energy ⋮ Some implications on amorphic association schemes ⋮ Paley type partial difference sets in non \(p\)-groups ⋮ Unnamed Item ⋮ Regular subgroups of primitive permutation groups ⋮ Recent progress in algebraic design theory ⋮ Weighted association schemes, fusions, and minimal coherent closures ⋮ Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach
Uses Software
