Graph is said to have a cycle, if there exists a path where the first and last vertices are the same, and no edge is repeated. (Option C)
In graph theory, a cycle graph or circular graph refers to a graph that consists of a single cycle, or some number of vertices connected in a closed chain. A cycle in a graph is a non-empty trail in which only the first and last vertices are equal and no edge is repeated. In a cycle graph the number of vertices is equal to the number of edges. A graph that contains at least one cycle is known as a cyclic graph. Conversely, a graph that contains zero cycles is known as an acyclic graph.
Note: The question is incomplete as it is missing options which are a) connected component b) algorithm c) cycle d) weight e) complete component.
Learn more about Cycle graph:
https://brainly.com/question/14786863
#SPJ4
