Lesson plan
Cyclic graph
In mathematics, a cyclic graph may mean a graph that contains a cycle, or a graph that is a cycle, with varying definitions of cycles. See: *Cycle (graph theory), a cycle in a graph *Forest (graph theory), an undirected graph with no cycles *Biconnected graph, an undirected graph in which every edge belongs to a cycle *Directed acyclic graph, a directed graph with no cycles *Strongly connected graph, a directed graph in which every edge belongs to a cycle *Aperiodic graph, a directed graph in which the cycle lengths have no nontrivial common divisor *Pseudoforest, a directed or undirected graph in which every connected component includes at most one cycle *Cycle graph, a graph that has the structure of a single cycle *Pancyclic graph, a graph that has cycles of all possible lengths *Cycle detection (graph theory), the algorithmic problem of finding cycles in graphs Other similarly-named concepts include *Cycle graph (algebra), a graph that illustrates the cyclic subgroups of a group *Circulant graph, a graph with an automorphism which permutes its vertices cyclically.
Article summary
In mathematics, a cyclic graph may mean a graph that contains a cycle, or a graph that is a cycle, with varying definitions of cycles. See: *Cycle (graph theory), a cycle in a graph *Forest (graph theory), an undirected graph with no cycles *Biconnected graph, an undirected graph in which every edge belongs to a cycle *Directed acyclic graph, a directed graph with no cycles *Strongly connected graph, a directed graph in which every edge belongs to a cycle *Aperiodic graph, a directed graph in which the cycle lengths have no nontrivial common divisor *Pseudoforest, a directed or undirected graph in which every connected component includes at most one cycle *Cycle graph, a graph that has the structure of a single cycle *Pancyclic graph, a graph that has cycles of all possible lengths *Cycle detection (graph theory), the algorithmic problem of finding cycles in graphs Other similarly-named concepts include *Cycle graph (algebra), a graph that illustrates the cyclic subgroups of a group *Circulant graph, a graph with an automorphism which permutes its vertices cyclically.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.