Welcome guest
You're not logged in.
395 users online, thereof 0 logged in

Definition: Trees and Forests

Let \(G(V,E,\gamma)\) be an undirected graph.

  • \(G\) is called a forest, if it contains only acyclic components.
  • \(G\) is called a tree, if it has only one acyclic component.

| | | | | Contributors: bookofproofs | References: [570]

1.Proposition: Equivalent Definitions of Trees

2.Lemma: Lower Bound of Leaves in a Tree

3.Definition: Spanning Tree

4.Definition: Graph Decomposable Into \(k\) Trees


This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

[570] Krumke Sven O., Noltemeier Hartmut: “Graphentheoretische Konzepte und Algorithmen”, Teubner, 2005, Auflage 1

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.