A Note on the Isomorphism Problem for Monomial Digraphs
Combinatorics
2018-07-31 v1
Abstract
Let be a prime be a positive integer, , and let denote the finite field of elements. Let , , be integers. The monomial digraph is defined as follows: the vertex set of is , and is an arc in if . In this note we study the question of isomorphism of monomial digraphs and . Several necessary conditions and several sufficient conditions for the isomorphism are found. We conjecture that one simple sufficient condition is also a necessary one.
Keywords
Cite
@article{arxiv.1807.11362,
title = {A Note on the Isomorphism Problem for Monomial Digraphs},
author = {Alex Kodess and Felix Lazebnik},
journal= {arXiv preprint arXiv:1807.11362},
year = {2018}
}
Comments
12 pages