paper

Adjacency Matrices of Configuration Graphs

arXiv:1002.1032 · doi:10.1016/j.laa.2012.05.029

Abstract

In 1960, Hoffman and Singleton \cite{HS60} solved a celebrated equation for square matrices of order , which can be written as where , , and are the identity matrix, the all one matrix, and a --matrix with all row and column sums equal to , respectively. If is an incidence matrix of some configuration of type , then the left-hand side is an adjacency matrix of the non--collinearity graph of . In certain situations, is also an incidence matrix of some configuration, namely the neighbourhood geometry of introduced by Lefèvre-Percsy, Percsy, and Leemans \cite{LPPL}. The matrix operator can be reiterated and we pose the problem of solving the generalised Hoffman--Singleton equation . In particular, we classify all --matrices with all row and column sums equal to , for , which are solutions of this equation. As a by--product, we obtain characterisations for incidence matrices of the configuration in Kantor's list \cite{Kantor} and the configuration $#1971$ in Betten and Betten's list \cite{BB99}.