Name
Abstract | ||
|---|---|---|
Let p be a prime, e a positive integer, q = p(e), and let F-q denote the finite field of q elements. Let f(i) : F-2(q) -> F-q be arbitrary functions, where 1 <= i <= 1, i and I are integers. The digraph D = D(q; f), where f = (f(1), ...,f(l)): F-2(q) -> F-q(l), is defined as follows. The vertex set of D is F-q(l+1). There is an arc from a vertex x = (x(1), ..., x(l+1)) to a vertex y = (y(1), ..., y(l+1)) if x(i) + y(i) = f(i-1)(x(l), y(1)) for all i, 2 <= i <= 1 + 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. |
Year | Venue | Keywords |
|---|---|---|
2015 | ELECTRONIC JOURNAL OF COMBINATORICS | Finite fields,Directed graphs,Strong connectivity |
Field | DocType | Volume |
Integer,Prime (order theory),Graph,Discrete mathematics,Finite field,Combinatorics,Vertex (geometry),Mathematics,Digraph | Journal | 22.0 |
Issue | ISSN | Citations |
3.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandr Kodess | 1 | 0 | 0.68 |
| Felix Lazebnik | 2 | 353 | 49.26 |