Consists of points (called vertices or nodes) which are connected by lines (edges or arcs)

1 of 23

Vertices

Points on a graph

2 of 23

Nodes

Points on a graph

3 of 23

Edges

Lines which connect the points on a graph

4 of 23

Arcs

Lines which connect the points on a graph

5 of 23

Weighted Graph

A graph which has a number associated with each edge (usually called its weight)

6 of 23

Network

A graph which has a number associated with each edge (usually called its weight)

7 of 23

Vertex Set

A list of vertices

8 of 23

Edge Set

A list of edges

9 of 23

Subgraph

A graph, each of whose vertices belongs to the original graph and each of whose edges belongs to the original graph. Basically it is part of the original graph

10 of 23

Degree of a Vertex

The number of edges incident to it

11 of 23

Valency of a Vertex

The number of edges incident to it

12 of 23

Order of a Vertex

The number of edges incident to it

13 of 23

Even Degree

When the degree of a vertex is even

14 of 23

Path

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

15 of 23

Walk

A path in which you are permitted to return to vertices more than once.

16 of 23

Cycle

A closed path, i.e. the end vertex of the last edge is the start vertex of the first edge.

17 of 23

Circuit

A closed path, i.e. the end vertex of the last edge is the start vertex of the first edge.

18 of 23

Connected

When there is a path between two vertices. A graph is connected if all its vertices are connected.

19 of 23

Loop

An edge that starts and finishes at the same vertex

20 of 23

Simple Graph

One in which there are no loops and does not have more than one edge connecting any pair of vertices.

21 of 23

Directed Edges

When the edges of a graph have a direction associated with them.

## Comments

No comments have yet been made