Involve: A Journal of Mathematics
- Volume 11, Number 2 (2018), 181-194.
Finding cycles in the $k$-th power digraphs over the integers modulo a prime
For prime and , let us define to be the digraph whose set of vertices is such that there is a directed edge from a vertex to a vertex if . We find a new way to decide if there is a cycle of a given length in a given graph .
Involve, Volume 11, Number 2 (2018), 181-194.
Received: 21 January 2014
Revised: 8 June 2017
Accepted: 21 June 2017
First available in Project Euclid: 20 December 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05C20: Directed graphs (digraphs), tournaments
Secondary: 11R04: Algebraic numbers; rings of algebraic integers
Dresden, Greg; Tu, Wenda. Finding cycles in the $k$-th power digraphs over the integers modulo a prime. Involve 11 (2018), no. 2, 181--194. doi:10.2140/involve.2018.11.181. https://projecteuclid.org/euclid.involve/1513775055