Connectivity of some Algebraically Defined Digraphs
Abstract
Let p be a prime, e a positive integer, q = pe, and let Fq denote the finite field of q elements. Let fi : Fq2q be arbitrary functions, where 1 i l, i and l are integers. The digraph D = D(q;f), where f=(f1,…o,fl) : Fq2ql, is defined as follows. The vertex set of D is Fql+1. There is an arc from a vertex x = (x1,…o,xl+1) to a vertex y = (y1,…o,yl+1) if xi + yi = fi-1(x1,y1) for all i, 2 i l+1. In this paper we study the strong connectivity of D and completely describe its strong components. The digraphs D are directed analogues of some algebraically defined graphs, which have been studied extensively and have many applications.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.