Abstract
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 .
Citation
Greg Dresden. Wenda Tu. "Finding cycles in the $k$-th power digraphs over the integers modulo a prime." Involve 11 (2) 181 - 194, 2018. https://doi.org/10.2140/involve.2018.11.181
Information