Completely regular designs of strength one

DOI10.1023/A:1022493523470zbMath0799.05012MaRDI QIDQ1321590

William J. Martin

Publication date: 28 April 1994

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Johnson graph\(t\)-designsequitable partitioncompletely regular designs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Related Items (14)

Perfect 3-colorings of the Johnson graph \(J(6, 3)\) ⋮ Boolean degree 1 functions on some classical association schemes ⋮ MMS-type problems for Johnson scheme ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Width and dual width of subsets in polynomial association schemes ⋮ Degree 2 Boolean functions on Grassmann graphs ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ Perfect 2‐colorings of Hamming graphs ⋮ On completely regular codes ⋮ Sporadic neighbour-transitive codes in Johnson graphs ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Neighbour-transitive codes in Johnson graphs ⋮ Cameron-Liebler sets in bilinear forms graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the diameter of distance. Regular graphs
• Completely regular codes
• Problems in algebraic combinatorics
• Completely regular designs
• Hahn Polynomials, Discrete Harmonics, andt-Designs

This page was built for publication: Completely regular designs of strength one