cycle
in graph theory, non-empty trail in which only the first and last vertices are equal
Agda Unimath: closed walk (undirected graph)Wikidata: cycle
Wikidata: cycle
Agda Unimath: cycle (undirected graph)
mathswitch — infrastructure for relaying and exchanging mathematical concepts
in graph theory, non-empty trail in which only the first and last vertices are equal
Agda Unimath: closed walk (undirected graph)