Automorphism Group of the Spectral Incidence Graph over Finite Fields
Abstract
Let be integers, a finite field with elements and the -dimensional vector space over . Let denotes the set of all nonzero matrices over having an eigenvector. We introduce the \emph{spectral incidence graph} of denoted by , a bipartite graph whose two vertex classes consist of the one-dimensional subspaces of generated by the matrices in and the one-dimensional subspaces of , respectively. A matrix vertex is adjacent to a one-dimensional subspace of , if and only if is an eigenvector of . Thus, adjacency is defined by the incidence relation between matrices and their invariant one-dimensional subspaces of . Using split short exact sequence theorem for the groups and fundamental theorem of projective geometry we determine the automorphism group of . For , we prove that and for , we obtain In both cases, the first factor corresponds to permutations of the classes of twin points (vertices having the same neighborhood). We also determined several structural parameters of , including classes of twin points, connectivity, domination number, diameter, vertices degrees and the number of edges.
Keywords
Cite
@article{arxiv.2607.26320,
title = {Automorphism Group of the Spectral Incidence Graph over Finite Fields},
author = {Ali Majidinya},
journal= {arXiv preprint arXiv:2607.26320},
year = {2026}
}
Comments
34 pages