Forest (graph theory)/Definition

From Citizendium

< Forest (graph theory)

Revision as of 16:48, 6 January 2009 by imported>Richard Pinch (In mathematics, an undirected graph with no cycles.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.

Forest (graph theory) [r]: In mathematics, an undirected graph with no cycles.

Retrieved from "https://citizendium.org/wiki/index.php?title=Forest_(graph_theory)/Definition&oldid=570114"