## You are here

Homeacyclic graph

## Primary tabs

# acyclic graph

Any graph that contains no cycles is an *acyclic graph*. A directed acyclic graph is often called a DAG for short.

$\begin{array}[]{cc}\xymatrix{\hfil&A\ar@{-}[dl]\ar@{-}[dr]\\ B&&C&\xymatrix{&A\ar[dr]\\ B\ar[ur]\ar[rr]&&C\end{array}$ |

In contrast, the following graph and digraph are *not* acyclic, because
each contains a cycle.

$\begin{array}[]{cc}\xymatrix{\hfil&A\ar@{-}[dl]\ar@{-}[dr]\\ B\ar@{-}[rr]&&C&\xymatrix{&A\ar[dr]\\ B\ar[ur]&&C\ar[ll]\end{array}$ |

Defines:

directed acyclic graph

Related:

Graph,Cycle, BetheLattice

Synonym:

acyclic, DAG

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

05C38*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff