Definition:Cycle (Graph Theory)/Also defined as
Jump to navigation
Jump to search
Cycle (in the context of Graph Theory): Also defined as
Some sources specify a cycle as having at least one edge.
Some sources specify that a cycle must indeed have at least $3$ edges, presupposing that the graph in which it is embedded is by definition a simple graph.
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 2.3.4.1$: Free Trees
- 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): cycle (in graph theory)