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)
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal.
A graph wit ...
, a cycle in a graph
*
Forest (graph theory)
In graph theory, a tree is an undirected graph in which any two vertices are connected by path, or equivalently a connected acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by path, or equiva ...
, an undirected graph with no cycles
*
Biconnected graph
In graph theory, a biconnected graph is a connected and "nonseparable" graph
Graph may refer to:
Mathematics
*Graph (discrete mathematics), a structure made of vertices and edges
**Graph theory, the study of such graphs and their properties
*G ...
, an undirected graph in which every edge belongs to a cycle
*
Directed acyclic graph
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called ''arcs''), with each edge directed from one ...
, a directed graph with no cycles
*
Strongly connected graph
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of a directed graph form a partition into subgraphs that are thems ...
, a directed graph in which every edge belongs to a cycle
*
Aperiodic graph
In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer ''k'' > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divis ...
, a directed graph in which the cycle lengths have no nontrivial common divisor
*
Pseudoforest
In graph theory, a pseudoforest is an undirected graphThe kind of undirected graph considered here is often called a multigraph or pseudograph, to distinguish it from a simple graph. in which every Connected component (graph theory), connected com ...
, a directed or undirected graph in which every connected component includes at most one cycle
*
Cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called ...
, a graph that has the structure of a single cycle
*
Pancyclic graph
In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from three up to the number of vertices in the graph.. Pancyclic graphs are a generalization of Ha ...
, a graph that has cycles of all possible lengths
*
Cycle detection (graph theory)
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal.
A graph with ...
, the algorithmic problem of finding cycles in graphs
Other similarly-named concepts include
*
Cycle graph (algebra)
In group theory, a subfield of abstract algebra, a cycle graph of a group (mathematics), group is an Graph (discrete mathematics), undirected graph that illustrates the various cyclic group, cycles of that group, given a set of Generator (mathema ...
, a graph that illustrates the cyclic subgroups of a group
*
Circulant graph, a graph with an
automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphism ...
which permutes its vertices cyclically.
{{sia