MATHEMATICS 2P GRAPHS AND NETWORKS
EXERCISE SHEET 2
1. Prove that the utilities graph is not planar by imitating the proof for the complete graph on ve vertices.
2. Show that if G is a simple connecte
MATHEMATICS 2P GRAPHS AND NETWORKS
EXERCISE SHEET 1
1. Draw
(a) all six non-isomorphic connected simple graphs with 4 vertices;
(b) all non-isomorphic connected simple graphs with p = q = 5;
(c) all n
Mathematics 2P Graphs and networks
10
3. BIPARTITE GRAPHS
Denition
A graph is bipartite if its vertices can be partitioned into two sets V1 and V2 such that every edge joins
a vertex in V1 to a vertex
MATHEMATICS 2P GRAPHS AND NETWORKS
SOLUTIONS TO EXERCISE SHEET 2
1. The utilities graph is the complete bipartite graph K3,3 , and it is a non-empty connected simple
graph. Suppose that it is planar w
Mathematics 2P Graphs and networks
28
8. FLOWS IN NETWORKS
Introduction
We consider directed graphs in which each edge is assigned a nonnegative number, called its capacity.
To object is to get as muc
Mathematics 2P Graphs and networks
5
2. TREES
Denition
Recall that a tree is a non-empty connected graph containing no cycles.
Paths in trees
Theorem 2.1. In a tree there is a unique path between any
Mathematics 2P Graphs and networks
42
11. CRITICAL PATH SCHEDULING
Introduction
We continue to study projects consisting of activities with various durations and precedence requirements. We want to co
Mathematics 2P Graphs and networks
23
6. EULERIAN GRAPHS
The Knigsberg bridges problem
o
In Knigsberg in 1738 there were islands and bridges in the river Pregel as shown.
o
A
B
C
D
The inhabitants wis
Mathematics 2P Graphs and networks
18
5. HAMILTONIAN GRAPHS
Introduction
Recall that a hamiltonian graph is a graph with a hamiltonian cycle, i.e. a cycle passing through all the
vertices.
For example
1
MATHEMATICS 2P GRAPHS AND NETWORKS
SOLUTIONS TO EXERCISE SHEET 1
1. (a)
(b)
(c)
2. The sum of the degrees of the vertices is twice the number of edges and is therefore even. It follows
that there mu
Thursday, 23rd November, 2006 10.10 am. to 10.55 am.
UNIVERSITY OF GLASGOW
Department of Mathematics
Mathematics 2P Graphs and Networks
Class Test
Candidates should attempt ALL questions.
1. Show that
?, ?th August/September, 2007 ? ?.m to ? ?.m
Hnihersitp of @Iasgutn
EXAanuHONFORIHHEDEGREEs0F
MAHANDBSQ
Mathematics 2P Graphs and Networks
Candidates must not attempt more than THREE questions.
1. S
1
MATHEMATICS 2P GRAPHS AND NETWORKS
SOLUTIONS TO EXERCISE SHEET 3
1. (a) In SADCT the forward edge DC is saturated, so SADCT is not ow-augmenting. In SBCET
the ows along the forward edges SB, BC, CE
Wednesday, 5th November, 2014 12.10 pm. to 12.55 pm.
University
(f Glasgow
EXAMINATION FOR THE DEGREES OF
M.A. AND B.Sc.
Mathematics 2P - Graphs and Networks
An electronic calculator may be used provi
Mathematics 2P Graphs and networks
25
7. DIRECTED GRAPHS
Denition
A directed graph or digraph is a graph in which each edge has a direction. In diagrams, the directions
are indicated by arrows, for ex
Mathematics 2P Graphs and networks
39
10. ACTIVITY NETWORKS
Introduction
In this chapter we apply the longest path algorithm to scheduling problems.
We consider a project consisting of several activit
me 2R (2%wa WWW:
Swans 1w wma, J 2007
D 7 C
m WW MC {W W
Lueéjkt S+6f§il§i
m,mdurium @LLP/ {Jo-B
. j J L
mas/5&2: [W4 wealbe Z WL},
(7F £§+z+4s 2/.
a W OWL #7 e Relic/Jim waran
(2 Midtean 2F 92%, w
Mathematics 2P Graphs and networks
35
9. THE SHORTEST AND LONGEST PATH ALGORITHMS
Introduction
In this chapter we mainly consider paths in directed graphs. All these paths are assumed to be directed
p
Mathematics 2P Graphs and networks
1
MATHEMATICS 2P GRAPHS AND NETWORKS
1. ELEMENTARY RESULTS ON GRAPHS
Denition
A graph is an object consisting of a nite set of vertices and a nite set of edges, such
SW b: 53? C(abbTaybz,SNw'l#.
t1. Wo
' 3
A- J3
F c E)
E Lb y A; r:
I: Dc ABUG. 1D 33,15
Agwém mam/42D
a~r U - E ' 3 ad.- AB Ha. AD WEE
C] o mapmaecgb.
YiWwMW21harij ® Laemaw Wqu P>,'3w_xfa-.,
Mathematics 2P Graphs and networks
11
4. PLANARITY
Denitions
A plane graph is a graph such that: the vertices are distinct points in a plane; the edges are curves
joining the vertices; the edges do no