Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diameter of Some Monomial Digraphs

Published 30 Jul 2018 in math.CO | (1807.11360v1)

Abstract: Let $p$ be a prime, $e$ a positive integer, $q = pe$, and let $\mathbb{F}q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q2\to\mathbb{F}_q$ be arbitrary functions, where $1\le i\le l$, $i$ and $l$ are integers. The digraph $D = D(q;\bf{f})$, where ${\bf f}=(f_1,\dotso,f_l) : \mathbb{F}_q2\to\mathbb{F}_ql$, is defined as follows. The vertex set of $D$ is $\mathbb{F}_q{l+1}$. There is an arc from a vertex ${\bf x} = (x_1,\dotso,x{l+1})$ to a vertex ${\bf y} = (y_1,\dotso,y_{l+1})$ if $ x_i + y_i = f_{i-1}(x_1,y_1) $ for all $i$, $2\le i \le l+1$. In this paper we study the diameter of $D(q; {\bf f})$ in the special case of monomial digraphs $D(q; m,n)$: ${\bf f} = f_1$ and $f_1(x,y) = xm yn$ for some nonnegative integers $m$ and $n$.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.