Aperiodic graph
id:
aperiodic-graph-191-17239117
title:
Aperiodic graph
text:
In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph G is called the period of G.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Aperiodic_graph
date created:
date modified:
2024-03-07T00:06:06Z
main entity:
{"identifier":"Q4779368","url":"https://www.wikidata.org/entity/Q4779368"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/a2/Aperiodic-graph.svg","width":201,"height":307}
fields total:
13
integrity:
14