A cycle is a graph Cn on vertices v1,v2,…,vn with edges {vi,v1+(imodn)} for 1≤i≤n, and no other edges; this is a path in which the first and last vertices have ...A cycle is a graph Cn on vertices v1,v2,…,vn with edges {vi,v1+(imodn)} for 1≤i≤n, and no other edges; this is a path in which the first and last vertices have been joined by an edge. (Generally, we require that a cycle have at least three vertices. If a cycle has one vertex, there is an edge, called a loop, in which a single vertex serves as both endpoints.) The length of a path or cycle is the number of edges in the graph.
