Completely regular designs

DOI10.1002/(SICI)1520-6610(1998)6:4%3C261::AID-JCD4%3E3.0.CO;2-DMaRDI QIDQ4222156zbMATH OpenOpenAlexFDO

Authors William J. Martin

Publication date 7 March 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6610(1998)6:4%3C261::aid-jcd4%3E3.0.co;2-d

zbMATH Keywords

\(t\)-designscompletely regular designsSteiner systemssymmetric designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Recommendations

• Completely regular designs of strength one
• A characterization of t-designs in terms of the inner distribution
• Super-regular Steiner 2-designs
• On compressing complete designs

Cited in

(19)

• Completely regular designs of strength one
• Minimum supports of eigenfunctions of Johnson graphs
• Characterizing imprimitive partition designs of binary Hamming graphs
• Super-regular Steiner 2-designs
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
• Sporadic neighbour-transitive codes in Johnson graphs
• The subconstituent algebra of a strongly regular graph
• Neighbour-transitive codes in Johnson graphs
• scientific article; zbMATH DE number 3890324 (Why is no real title available?)
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• scientific article; zbMATH DE number 50974 (Why is no real title available?)
• Cameron-Liebler line classes in PG(n,4)
• scientific article; zbMATH DE number 1043888 (Why is no real title available?)
• On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
• On completely regular codes
• On completely regular codes with minimum eigenvalue in geometric graphs
• Symmetric perfect 2-colorings of \(J(10,3)\)
• Equitable 2-partitions of the Johnson graphs J(n,3)

This page was built for publication: Completely regular designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222156)