Graphs and Networks
Graphs and Networks
Decision 1 Overview
150 E 60
A Watch out – a weighted
30 80 100 F
B graph is not normally
60 50 D 90 drawn to scale.
Server
80
100 C
F
D E
The edges, or arcs are AB, AC, AF, BC, BD, CE, CE and DE this list is
sometimes called the edge set.
Subgraphs
B
A
F
D E
C
F
D E D E
Two possible subgraphs of the graph above. Draw another subgraph in here
Degree or valency
B
A
F
D E
The degree or valency or order of a vertex is the number of edges incident to it.
Vertex Degree
If a vertex has even degree we
A 3
say it is even, similarly if the
B 3 vertex has odd degree we say
C 3 it is an odd vertex.
D 2
E 2
F 1 An odd vertex.
Test you understanding
B
A
The degree or valency or order of a vertex is the number of edges incident to it.
Vertex Degree
A 2
B 4
C 5
D 3
Walks, paths, trails and cycles
B
An example of a …
A Walk is FAEDFAB
Path is FAEC
C Trail is FABCEA
Cycle is FAEDF
F
Hamiltonian cycle
D E is FABCEDF
A walk is a route through a graph along edges from one vertex to the next.
A path is a walk in which no vertex is visited more than once.
A trail is a walk in which no edge is visited more than once.
A cycle is a walk in which the end vertex is the same as the start vertex and no
other vertex is visited more than once.
A Hamiltonian cycle is a cycle which includes every vertex.
A walk is a route through a graph along edges from one vertex to the next.
A path is a walk in which no vertex is visited more than once.
A trail is a walk in which no edge is visited more than once.
A cycle is a walk in which the end vertex is the same as the start vertex and no
other vertex is visited more than once.
A Hamiltonian cycle is a cycle which includes every vertex.
B
In this network A is connected
C to C but the network is not
connected because E is not
connected to the server.
A
Is the Great Britain mainland road network connected? Think then click.
Test your understanding
Which of these graphs are connected?
Connected Not connected
B
A
B
A
F
F D E
D C
F D
Loops and multiple edges
A loop is an edge which starts and finishes at the same vertex.
B
A
D
A loop
If a graph represented a
telephone network, why would
you want multiple edges?
B
A
Two examples of simple graphs
C
F D
Source
Directed Graphs
A directed graph is one in which the edges of the graph have a
direction associated with them, the edges are known as directed
edges. Directed graph is often abbreviated to digraph.
A B
F D
B
A
On this graph there are 2
C odd vertices
Tree C
F
D C D
Tree C C
D E F D
2.3 Spanning trees
A spanning tree is a subgraph, which
includes all the vertices and is a tree.
A B
D
C
B D
A B A
C C
A B
D B D
A C
C
D
D
2.3 Complete graphs
A complete graph is a graph in which every vertex is directly
connected by a single edge to each of the other vertices.
𝐾1 𝐾2 𝐾3
𝐾4 𝐾5 𝐾6
Isomorphic graphs
Isomorphic graphs are graphs which show the same information
but may be drawn differently.
Is isomorphic to
B and B
A A E
Is isomorphic to
E C
F D F
C D
Test your understanding
Identify the two isomorphic graphs below and justify why they
are isomorphic.
A
B
A 1 B
3 C
D C
B
Graph 1 is isomorphic to graph 2.
On both graphs
C • Vertex A is directly connected to B and D
A
2 • Vertex B is directly connected to A, B
and with a double edge to C
D
• Vertex D is directly connected to A, B,
and with a double edge to C
• Vertex C is directly connected to with a
double edge to D and B and a loop