Diameter of some monomial digraphs
From MaRDI portal
Publication:2829804
DOI10.1142/9789814719261_0010zbMATH Open1354.05060arXiv1807.11360OpenAlexW2503824818MaRDI QIDQ2829804FDOQ2829804
A. Kodess, J. Sporre, S. Smith, Felix Lazebnik
Publication date: 8 November 2016
Published in: Contemporary Developments in Finite Fields and Applications (Search for Journal in Brave)
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 diameter of in the special case of monomial digraphs : and for some nonnegative integers and .
Full work available at URL: https://arxiv.org/abs/1807.11360
Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Connectivity (05C40) Polynomials over finite fields (11T06)
Cited In (2)
Recommendations
- Title not available (Why is that?) π π
- The diameter of almost Eulerian digraphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- The diameters of almost all Cayley digraphs π π
- Title not available (Why is that?) π π
- Maximum diameter of regular digraphs π π
- Some properties of graphs of diameters π π
- The diameter of cyclic Kautz digraphs π π
- The diameter of cyclic Kautz digraphs π π
This page was built for publication: Diameter of some monomial digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829804)