Forest (graph theory)/Definition: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (In mathematics, an undirected graph with no cycles.) |
(No difference)
|
Latest revision as of 17:48, 6 January 2009
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.