Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos
tree
References
Images
two isomorphic graphs and a tree
Britannica AI Icon

tree

graph theory
Written by
The Information Architects of Encyclopaedia Britannica

The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.
The Information Architects of Encyclopaedia Britannica
Last updated

Quick Summary

two isomorphic graphs and a tree
two isomorphic graphs and a tree Figure 3: Two isomorphic graphs and a tree.

In graph theory, a tree is a specific type of graph that contains no cycles. A graph itself is a mathematical concept consisting of points (vertices) connected by lines (edges). Trees are fundamental structures in graph theory and have applications in various fields, including computer science.12

The number of labeled trees with v vertices is given by the formula vv−2. The study of trees and other graph structures is a significant area of mathematical research.32

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.
6 Britannica Sources
  1. combinatorics - Directed graphs
  2. combinatorics - Definitions
  3. graph theory
  4. combinatorics - Enumeration of graphs
  5. graph theory
  6. tree - The anatomy and organization of wood

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.