Completely regular designs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1998)6:4<261::AID-JCD4>3.0.CO;2-D" /><261::AID-JCD4>3.0.CO;2-D 10.1002/(SICI)1520-6610(1998)6:4<261::AID-JCD4>3.0.CO;2-DzbMath0928.05008OpenAlexW2147236851MaRDI QIDQ4222156

William J. Martin

Publication date: 7 March 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1998)6:4<261::aid-jcd4>3.0.co;2-d

zbMATH Keywords

Steiner systemssymmetric designs\(t\)-designscompletely regular designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (13)

Minimum supports of eigenfunctions of Johnson graphs ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ The subconstituent algebra of a strongly regular graph ⋮ The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Cameron-Liebler line classes in \(PG(n,4)\) ⋮ On completely regular codes ⋮ Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) ⋮ Sporadic neighbour-transitive codes in Johnson graphs ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Neighbour-transitive codes in Johnson graphs ⋮ Characterizing imprimitive partition designs of binary Hamming graphs ⋮ Completely regular designs of strength one

This page was built for publication: Completely regular designs