DEPARTMENT OF MATHEMATICS
102 FINITE MATHEMATICS & LINEAR ALGEBRA
Problem Sheet 1
1.
(a) Draw a graph with vertices
v
1
, v
2
, v
3
and
v
4
and edges (
v
1
, v
2
)
,
(
v
1
, v
3
)
,
(
v
2
, v
3
)
,
(
v
2
, v
4
)
and (
v
4
, v
1
).
(b) Write down the number of edges, the degree of each vertex and the sum of the degrees
of the vertices in the graph drawn.
2. The
intersection graph
of a collection of sets
A
1
, A
2
, . . . , A
n
is the graph that has a
vertex for each of these sets and has an edge connecting a pair of vertices if and only if
the sets represented by these vertices have a nonempty intersection.
(a) Construct the intersection graph of the following collection of sets:
A
1
=
{
0
,
2
,
4
,
6
,
8
}
,
A
2
=
{
0
,
1
,
2
,
3
,
4
}
, A
3
=
{
1
,
3
,
5
,
7
,
9
}
, A
4
=
{
5
,
6
,
7
,
8
,
9
}
,
A
5
=
{
0
,
1
,
8
,
9
}
.
(b) Write down the number of edges in the graph constructed in (a).
(c) Write down the degree of each vertex and the sum of the degrees of the vertices in
the graph constructed in (a).
3. Seven towns
A, B, C, D, E, F
and
G
are connected by a system of highways as follows:
(1) H1 goes from
A
to
C
passing through
B
; (2) H2 goes from
C
to
D
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '11
 rsharma
 Graph Theory, Berlin UBahn, vertices, Intersection graph, Department of Mathematics

Click to edit the document details