toIPA
Home
Blog
Category
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
Pronunciation
/ˌeɪpɪriˈɑdɪk ɡræf/
/ˌeɪpɪərɪˈɒdɪk ɡrɑːf/
Categories
directed graph