Pages that link to "Item:Q1321590"
From MaRDI portal
The following pages link to Completely regular designs of strength one (Q1321590):
Displayed 14 items.
- Perfect 3-colorings of the Johnson graph \(J(6, 3)\) (Q826569) (← links)
- Width and dual width of subsets in polynomial association schemes (Q1395814) (← links)
- Boolean degree 1 functions on some classical association schemes (Q1633376) (← links)
- Cameron-Liebler sets in bilinear forms graphs (Q2034984) (← links)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii (Q2152798) (← links)
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue (Q2198380) (← links)
- Sporadic neighbour-transitive codes in Johnson graphs (Q2249651) (← links)
- Neighbour-transitive codes in Johnson graphs (Q2510649) (← links)
- MMS-type problems for Johnson scheme (Q2633492) (← links)
- Degree 2 Boolean functions on Grassmann graphs (Q2684903) (← 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)
- Perfect 2‐colorings of Hamming graphs (Q6186659) (← links)