94
Chapter 4 Graphs
| Date post: | 20-Jan-2016 |
| Category: |
Documents |
| View: | 232 times |
| Download: | 1 times |
Chapter 4
Graphs
2
4.1 GRAPHS AND THEIR REPRESENTATIONS
3
4
5
6
7
8
9
Other Representations of Graphs
10
11
12
Isomorphism
13
14
15
16
17
18
19
4.2 PATHS AND CIRCUITS
A multigraph consists of a nonempty finite set of vertices and a set of edges, where we allow an edge to join a vertex to itself or to a different vertex, and where we allow several edges joining the same pair of vertices. An edge from a vertex to itself is called a loop. When there is more than one edge between two vertices, these edges are called parallel edges.
20
21
22
23
24
25
26
27
Euler Circuits and Paths
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
4.3 SHORTEST PATHS AND DISTANCE
46
47
48
49
50
51
Weighted Graphs
52
53
54
55
56
57
58
59
60
61
4.4 COLORING A GRAPH
62
63
64
65
66
67
68
69
70
71
72
73
74
4.5 DIRECTED GRAPHS AND MULTIGRAPHS
75
76
77
78
Representations of Directed Graphs
79
80
81
82
83
84
85
86
87
Directed Euler Circuits and Paths
88
89
90
91
Directed Hamiltonian Cycles and Paths
92
93
94
