On distance-regular graphs with =2
From MaRDI portal
On distance-regular graphs with \(\lambda=2\)
Recommendations
- Automorphisms of a distance-regular graph with intersection array \(\{39,36,4;1,1,36\}\)
- On antipodal distance-regular graphs with =1
- Automorphisms of distance-regular graph with intersection array \(\{25,16,1;1,8,25\}\)
- On automorphisms of distance-regular graph with intersection array \(\{18,15,9;\,1,1,10\}\)
- Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) does not exist
Cites work
Cited in
(9)- Two distance-regular graphs
- On automorphisms of a distance-regular graph with intersection array \(\{39,36,22;1,2,18\}\)
- Automorphisms of a distance regular graph with intersection array \(\{21,18,12,4;1,1,6,21\}\)
- Automorphisms of graph with intersection array \(\{63,60,1; 1,4,63\}\)
- On automorphisms of distance-regular graphs with intersection arrays \(\{2r + 1, 2r 2, 1; 1, 2, 2r + 1\}\)
- Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)
- Two results concerning distance-regular directed graphs
- On antipodal distance-regular graphs with =1
- Automorphisms of a distance-regular graph with intersection array \(\{39,36,4;1,1,36\}\)
This page was built for publication: On distance-regular graphs with \(\lambda=2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5852822)