Abstract
We construct a bipartite distance-regular graph with intersection array {45, 44, 36, 5; 1, 9, 40, 45} and automorphism group 35 :(2 ×M10) (acting edge-transitively) and discuss its relation to previously known combinatorial structures.
Original language | English |
---|---|
Pages (from-to) | 153-156 |
Number of pages | 4 |
Journal | Journal of Algebraic Combinatorics |
Volume | 8 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1998 |