Decision 1 Graphs

HideShow resource information
Tree
A connected graph with no cycles
1 of 7
Simple graph
A graph with noo loops or multiple edges, 1 egdge connected any two vertices
2 of 7
A Path
A route from one vertex to another which doesnt repeat an edge or vertex
3 of 7
A cycle
A route starting and ending at the same vertex
4 of 7
Complete graph
A sample graph in which every pair of vertices is connected by an edge
5 of 7
Connected graph
A graph in which there is a route from each vertex to any other vertex
6 of 7
Bipartite graph
The vertices are in two sets and each edge has a vertex from each set
7 of 7

Other cards in this set

Card 2

Front

A graph with noo loops or multiple edges, 1 egdge connected any two vertices

Back

Simple graph

Card 3

Front

A route from one vertex to another which doesnt repeat an edge or vertex

Back

Preview of the back of card 3

Card 4

Front

A route starting and ending at the same vertex

Back

Preview of the back of card 4

Card 5

Front

A sample graph in which every pair of vertices is connected by an edge

Back

Preview of the back of card 5
View more cards

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »