A cycle in a graph is a non-empty circuit in which only the first and last vertices are equal. Cycle with length is denoted by .