English

Connectivity of some Algebraically Defined Digraphs

Combinatorics 2018-07-31 v1

Abstract

Let pp be a prime, ee a positive integer, q=peq = p^e, and let Fq\mathbb{F}_q denote the finite field of qq elements. Let fi:Fq2Fqf_i : \mathbb{F}_q^2\to\mathbb{F}_q be arbitrary functions, where 1il1\le i\le l, ii and ll are integers. The digraph D=D(q;f)D = D(q;\bf{f}), where f=(f1,,fl):Fq2Fql{\bf f}=(f_1,\dotso,f_l) : \mathbb{F}_q^2\to\mathbb{F}_q^l, is defined as follows. The vertex set of DD is Fql+1\mathbb{F}_q^{l+1}. There is an arc from a vertex x=(x1,,xl+1){\bf x} = (x_1,\dotso,x_{l+1}) to a vertex y=(y1,,yl+1){\bf y} = (y_1,\dotso,y_{l+1}) if xi+yi=fi1(x1,y1) x_i + y_i = f_{i-1}(x_1,y_1) for all ii, 2il+12\le i \le l+1. In this paper we study the strong connectivity of DD and completely describe its strong components. The digraphs DD are directed analogues of some algebraically defined graphs, which have been studied extensively and have many applications.

Keywords

Cite

@article{arxiv.1807.11347,
  title  = {Connectivity of some Algebraically Defined Digraphs},
  author = {Alex Kodess and Felix Lazebnik},
  journal= {arXiv preprint arXiv:1807.11347},
  year   = {2018}
}

Comments

11 pages

R2 v1 2026-06-23T03:19:00.103Z