Automorphisms of linear functional graphs over vector spaces
Combinatorics
2020-06-17 v2
Abstract
Let be a finite field with elements, a positive integer, a -dimensional vector space over and the set of all linear functionals from to . Let and . The \emph{linear functional graph} of dented by , is an undirected bipartite graph, whose vertex set is partitioned into two sets as and two vertices and are adjacent if and only if sends to the zero element of (i.e. ). In this paper, the structure of all automorphisms of this graph is characterized and formolized. Also the cardinal number of automorphisms group for this graph is determined.
Cite
@article{arxiv.2006.08201,
title = {Automorphisms of linear functional graphs over vector spaces},
author = {Ali Majidinya},
journal= {arXiv preprint arXiv:2006.08201},
year = {2020}
}
Comments
preprint