Connectivity of some Algebraically Defined Digraphs
Combinatorics
2018-07-31 v1
Abstract
Let be a prime, a positive integer, , and let denote the finite field of elements. Let be arbitrary functions, where , and are integers. The digraph , where , is defined as follows. The vertex set of is . There is an arc from a vertex to a vertex if for all , . In this paper we study the strong connectivity of and completely describe its strong components. The digraphs 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