Name
Abstract | ||
|---|---|---|
Let p be a prime e be a positive integer, q = p(e), and let F-q denote the finite field of q elements. Let m, n, 1 <= m, n <= q - 1, be integers. The monomial digraph D = D(q; m,n) is defined as follows: the vertex set of D is F-q(4), and ((x(1), x(2)), (y(1), y(2))) is an arc in D if x(2) + y(2) = x(1)(m)y(1)(m). In this note we study the question of isomorphism of monomial digraphs D(q; m(1), n(1)) and D(q; m(2), n(2)). Several necessary conditions and several sufficient conditions for the isomorphism are found. We conjecture that one simple sufficient condition is also a necessary one. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1142/S0219265917410067 | JOURNAL OF INTERCONNECTION NETWORKS |
Field | DocType | Volume |
Integer,Prime (order theory),Combinatorics,Finite field,Vertex (geometry),Computer science,Computer network,Isomorphism,Monomial,Conjecture,Digraph | Journal | 17 |
Issue | ISSN | Citations |
SP3-4 | 0219-2659 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandr Kodess | 1 | 0 | 0.68 |
| Felix Lazebnik | 2 | 353 | 49.26 |