Cycle Graph
Jump to navigation
Jump to search
A Cycle Graph is a Cyclic Graph with one Graph Cycle and every Graph Node has only Two Graph Edges.
- See: Ring Structure.
References
- http://en.wikipedia.org/wiki/Cyclic_graph
- In graph theory, a cycle graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain. The cycle graph with [math]\displaystyle{ n }[/math] vertices is called Cn. The number of vertices in a Cn equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.