Tiber Tutor

definitions

IB Maths AI 3.11 Definitions

This page contains our IB Maths AI definitions for 3.11. By learning each one of these definitions, you will fully cover the content for IB Maths AI 'Graph theory'.

adjacent

The side next to the chosen acute angle in a right-angled triangle, not including the hypotenuse.
HL

complete

Describes a simple graph in which every pair of distinct vertices is joined by an edge.
HL

degree

The highest power of xx with a non-zero coefficient in a polynomial.
HL

edge

A connection between two vertices.
HL

simple

Describes a graph with no loops and no repeated edges between the same pair of vertices.
HL

subgraph

A smaller graph formed using some of the vertices and some of the edges of a larger graph, where the chosen edges join only chosen vertices.
HL

tree

A connected graph with no cycles; if it has nn vertices then it has exactly n1n-1 edges.
HL

vertex

A point in a graph.
HL

weighted

Describes a graph whose edges have numbers attached to them to represent quantities such as distance, cost, or time.

Next Up

You have completed the topic 3 definitions for IB Maths AI - continue with related resources below or explore the full IB Maths AI course from the IBO.

Other topic 3 resources