Content code
m1418
Slug (identifier)
types-of-graphs
Parent content
Grades
Secondary V
Topic
Mathematics
Content
Contenu
Links
Title (level 2)
Trees
Title slug (identifier)
arbre
Contenu
Content
Corps

Trees are connected graphs without a simple cycle, i.e., a chain cannot be established in graphs which start and end at the same point without passing through the same edge twice.

Content
Columns number
2 columns
Format
50% / 50%
First column
Image
image
Second column
Image
image
Corps

Trees are also used in probability for counting problems.

Content
Corps

Example of a tree in a probability situation

Image
Tree.
Corps

Trees can also be used to determine the lowest common multiple (LCM) of a group of numbers.

Content
Corps

Here are some examples that are NOT trees

Image
Tree.
Description

It’s not connected!

Image
Tree.
Description

BCDB is a simple chain!

Title (level 2)
The Weighted Graph
Title slug (identifier)
value
Contenu
Content
Corps

A weighted graph is a graph where each of the edges has a value. The valued graph can either be directed or not.

Corps

We calculate the value of a chain (or a cycle) by adding the values of the edges in it.

Content
Image
image
Title (level 2)
The Directed Graph
Title slug (identifier)
oriente
Contenu
Content
Corps

A directed graph is a graph where the edges have a direction (→). Chains and cycles must respect the direction of the arrows.

Content
Corps

The name of an edge takes into account its direction. AB ≠ BA

Image
Edge.
Content
Image
image
Content
Corps

Occasionally, a coloured graph may be encountered. This concept is used when solving chromatic number problems.

Remove audio playback
No