Double Covers of Symplectic Dual Polar Graphs
Combinatorics
2015-09-22 v2
Abstract
Let be the dual polar graph of type . Underlying this graph is a -dimensional vector space over a field of odd order , together with a symplectic (i.e. nondegenerate alternating bilinear) form . The vertex set of is the set of all -dimensional totally isotropic subspaces of . If mod 4, we obtain from a nontrivial two-graph on invariant under . This two-graph corresponds to a double cover on which is naturally defined a -polynomial -class association scheme on vertices.
Keywords
Cite
@article{arxiv.1504.01067,
title = {Double Covers of Symplectic Dual Polar Graphs},
author = {G. Eric Moorhouse and Jason Williford},
journal= {arXiv preprint arXiv:1504.01067},
year = {2015}
}