English

Automorphisms of linear functional graphs over vector spaces

Combinatorics 2020-06-17 v2

Abstract

Let Fq\mathbb{F}_q be a finite field with qq elements, n2n\geq2 a positive integer, V0\mathbb{V}_0 a nn-dimensional vector space over Fq\mathbb{F}_q and T0\mathbb{T}_0 the set of all linear functionals from V0\mathbb{V}_0 to Fq\mathbb{F}_q. Let V=V0{0}\mathbb{V}=\mathbb{V}_0\setminus\{0\} and T=T0{0}\mathbb{T}=\mathbb{T}_0\setminus\{0\}. The \emph{linear functional graph} of V0\mathbb{V}_0 dented by ϝ(V)\digamma(\mathbb{V}), is an undirected bipartite graph, whose vertex set VV is partitioned into two sets as V=VTV=\mathbb{V}\cup \mathbb{T} and two vertices vVv\in \mathbb{V} and fTf\in \mathbb{T} are adjacent if and only if ff sends vv to the zero element of Fq\mathbb{F}_q (i.e. f(v)=0f(v)=0). 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.

Keywords

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

R2 v1 2026-06-23T16:19:34.368Z