GRAPHS FOR ORTHOGONAL ARRAYS AND PROJECTIVE PLANES OF EVEN ORDER

被引:1
|
作者
Glynn, David G. [1 ]
Byatt, David [2 ]
机构
[1] Flinders Univ S Australia, Adelaide, SA 5001, Australia
[2] Univ Canterbury, Dept Math & Stat, Christchurch 8140, New Zealand
关键词
finite projective plane; orthogonal array; graph; invariant; tournament;
D O I
10.1137/100809155
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider orthogonal arrays of strength two and even order q having n columns which are equivalent to n - 2 mutually orthogonal Latin squares of order q. We show that such structures induce graphs on n vertices, invariant up to complementation. Previous methods worked only for single Latin squares of even order and were harder to apply. If q is divisible by 4, the invariant graph is simple undirected. If q is 2 modulo 4, the graph is a tournament. When n = q + 1 is maximal, the array corresponds to an affine plane, and the vertex valencies of the graph have parity q/2 modulo 2. We give the graphs at all possible points and lines for 22 planes of order 16. Four of the planes, none of them of translation or dual translation type, produce nonempty graphs at some points.
引用
收藏
页码:1076 / 1087
页数:12
相关论文
共 50 条