Lecture Intro To Graph Theory
Lecture Intro To Graph Theory
Graph Theory:
Terminologies, Concepts and Properties
Graph theory
• Graph theory is a branch of mathematics concerned
with how networks can be encoded and their
properties measured.
3 4
Vertex (Node)
2 km 2 km
1 6 km 6
3 km
5 km 2 km
4 5
7 km
Two Common Fallacies in Transport
Geography
Access vs. Accessibility Distance vs. Time
55
50
50 30
b 25 55
35 30
35 30
40 30 40
65 35 40 45
65
c
60 65 60
a
Absolute and Relative Distance in a
Network
Absolute Distance Relative Distance
10 km 30 minutes
Topology and Network Connectivity
A
B C
D
Minimum Network
Geographic Barrier
Network Length
Network Strategies to Service a Set of
Locations
A B C
D E F
Planar and Non-Planar Graphs
A B
Planar Non-Planar
Types of Transportation Networks
Road
Linear Tree
Network Patterns
3,000
550 550
3,000
525 52
5
3,000 1,550
3,000 525 52
5
550 550
3,000
2 1 2 3
Perfect spoke
1 1 3
C 5 Perfect hub D 2 2 2
1 1
1 3
Diameter of a Graph
2 4 6 Shimbel Distance
v 1 2 3 4 5 6 7
1 0 1 1 2 2 1 3
2 1 0 2 1 3 2 4
3 1 2 0 3 1 2 2
1 3 5 4 2 1 3 0 2 1 3
5 2 3 1 2 0 1 1
Diameter = 4 7 6 1 2 2 1 1 0 2
7 3 4 2 3 1 2 0
A B
d=? d=?
1 3 1 3 5
2 4 6 2 4 6
C D
d=? d=?
1 3 5 1 3 5
Cyclomatic Number
u = e−v+ p
A B
e v p u
A 3 5 2 0
B 5 5 1 1
C 5 4 1 2
D 7 6 1 2
C D
Detour index
relative efficiency
c
b
2 a 3
• Route (b) represents an attempt to reduce costs and this at the expense of a direct path.
• Route (c) will be the one used to link locations 1 and 3. It offers a compromise between the lost
distance (a higher detour) and the supplementary construction costs imposed by higher elevations.
L (G )
A =
e
B
Eta Index
L (G )
A =
e
L(G) e Eta
A 80 km 5 16.0
B 80 km 7 11.4
B
Average length per link
Theta Index
A Q (G )
=
v
A Q (G )
=
v
Q(G) v Theta
A 3,500 t 6 583.3
B 3,500 t 8 437.5
B
1
A B 1
Order (o)
3 1 4 1 L(G )
=
W (G )
W (G ) = 1, o = 1
1 4 1 W (G ) = 2 * o, o 1
e
3 3
1
1 1 1 1
Iota Index
1 L(G )
A B 1 =
W (G )
Order (o) W (G ) = 1, o = 1
W (G ) = 2 * o, o 1
3 1 4 1 e
1
1 1 1 1
W(A) = 1+6+6+6+1+1+1+1
W(B) = 1+1+8+1+1+8+1+1
Beta Index
e
A B
=
v
e v Bet
a
A 2 4 0.5
B 3 4 0.75
C D C 4 4 1.0
D 5 4 1.25
e
A B
=
v
e v Beta
A 2 4 0.5
B 3 4 0.75
C 4 4 1.0
C D
D 5 4 1.25
u
Alpha Index =
2v − 5 (for planar graphs)
A B (f
u= 2v-5 Alpha
(e-v+p)
A 0 3 0.0
B 1 3 0.33
C D C 2 3 0.66
D 3 3 1.0
• https://transportgeography.org/