MYP Extended Mathematics Network Types Key Definitions

A **bipartite graph** is a graph whose vertices can be divided into two sets so that every edge connects a vertex in one set to a vertex in the other set.

A graph where every pair of distinct vertices is joined by an edge.

A graph where every vertex can be reached from every other vertex by traveling along edges (possibly using several edges).

A collection of vertices (nodes) connected by edges (links) that have a specific direction.

A set of objects (called nodes or vertices) that are connected together.

A graph where edges have no direction, so if vertex $A$ is connected to vertex $B$, then $B$ is also connected to $A$.

A **weighted graph** is a graph in which every edge has an associated number (a weight), representing something like distance, time, cost, or risk.