The following pages link to Completely regular codes (Q1199625):
Displaying 16 items.
- Completely regular clique graphs. II (Q256544) (← links)
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- A note on binary completely regular codes with large minimum distance (Q389210) (← links)
- On a family of binary completely transitive codes with growing covering radius (Q394307) (← links)
- Completely regular clique graphs (Q402941) (← links)
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes (Q403556) (← links)
- Completely regular codes with different parameters giving the same distance-regular coset graphs (Q526258) (← links)
- Intriguing sets of vertices of regular graphs (Q604997) (← links)
- Conway groupoids and completely transitive codes (Q722342) (← links)
- On new completely regular \(q\)-ary codes (Q926628) (← links)
- On non-antipodal binary completely regular codes (Q932675) (← links)
- On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (Q4929281) (← links)
- Characters and Brauer trees of the covering group of ²𝐸₆(2) (Q5138276) (← links)
- Conway’s groupoid and its relatives (Q5138279) (← links)
- A general construction of strictly Neumaier graphs and a related switching (Q6046159) (← links)
- On new infinite families of completely regular and completely transitive codes (Q6197705) (← links)
