Aperiodic Graph

Directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph; graph is aperiodic if the greatest common divisor of the lengths of its cycles (period of G) is one
tendance
OctoberNovemberDecember2021FebruaryMarch0500