The following pages link to Completely regular designs (Q4222156):
Displaying 14 items.
- Cameron-Liebler line classes in \(PG(n,4)\) (Q404949) (← links)
- Completely regular designs of strength one (Q1321590) (← links)
- Minimum supports of eigenfunctions of Johnson graphs (Q1637129) (← links)
- Characterizing imprimitive partition designs of binary Hamming graphs (Q1827338) (← links)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii (Q2152798) (← links)
- The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances (Q2182237) (← links)
- Sporadic neighbour-transitive codes in Johnson graphs (Q2249651) (← links)
- The subconstituent algebra of a strongly regular graph (Q2388446) (← links)
- Neighbour-transitive codes in Johnson graphs (Q2510649) (← links)
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) (Q3540916) (← links)
- On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (Q4929281) (← links)
- On completely regular codes (Q5970864) (← links)
- On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848) (← links)
- Symmetric perfect 2-colorings of \(J(10,3)\) (Q6671814) (← links)
