D1 Definitions You Need To Know

Created by: Lucy Carr
Created on: 15-05-13 18:17

Path

A finite sequence of edges, such that the end vertex of one edge is the start of the next, and no vertex appears more than once.

1 of 10

Walk

A path where you can return to vertices more than once.

2 of 10

Cycle

A closed path.

3 of 10

Degree/Valency/Order

The number of edges incident to a vertex.

4 of 10

Tree

A connected graph with no cycles.

5 of 10

Spanning Tree

A subgraph which includes all the vertices of the original graph and is also a tree.

6 of 10

Minimum Spanning Tree

A spanning tree such that the total length of its arcs (edges) is as small as possible.

7 of 10

Complete Graph

A graph in which every vertex is directly connected by an edge to each of the other vertices.

8 of 10

Bipartite Graph

A graph that consists of 2 sets of vertices, X and Y. The edges ONLY join vertices in X to those in Y.

9 of 10

Isomorphic Graphs

Graphs that show the same information but are drawn differently.

10 of 10

Other cards in this set

Card 2

Front

A path where you can return to vertices more than once.

Back

Walk

Card 3

Front

A closed path.

Back

Card 4

Front

The number of edges incident to a vertex.

Back

Card 5

Front

A connected graph with no cycles.

Back

View more cards

Similar Mathematics resources:

See all Mathematics resources »

See all Networks, algorithms and problem solving resources »

Get Revising

D1 Definitions You Need To Know