ENGG2440B: Discrete Mathematics for Engineers

201516 First Term

Homework Set 6 Solutions

Instructor: Anthony Man-Cho So

Teaching Assistant: Conghui Tan

Pn
Pn
Problem 1. Suppose that deg(v) < 2E/n, then we have
i=1 deg(vi )
i=1 deg(v) <
n 2E/n = 2E, which contradicts the Handshaking Lemma. Thus, deg(v) 2E/n.
Problem 2. Since G is a simple graph, so every vertex in G can be connected with at most all
of the rest |V | 1 vertices, which means |V | 1 k. So the smallest possible number of vertices in
G should be k + 1, and the graph that attains the smallest number of vertices is k-regular graph.
Problem 3. Suppose there exists such an edge e = (u, v)Sin G that G e is still connected. It
means there exists a path P from u to v in G e. Then {e} P is a cycle in G, which contradicts
the definition of tree.
Problem 4.
(a) The overall numbers of edges associated with L and R are k |L| and k |R| respectively. Then
k |L| = k |R|, so |L| = |R|.
(b) Suppose (u, v) is a cut-edge in G where u L and v R. After removal this edge, G will
be separated into two components: G1 andTG2 . Without loss of generality, we assume that
u G1 . Consider the overall degrees in G1 R. Since the degree ofTevery vertex in this part
is still k, the number of edges in G1 incident to T
this part is k |G1 R|, which is a multiple
of k.
However,
since
deg(u)
=
k

1
and
u

G
L, so the number of edges associated with
1
T
T
G1 L is k |G1 L| 1, which cannot be a multiple of k because k 2. So inconsistence
arises in the degrees of these two parts. Thus there is no cut-edge in G.
Problem 5.
(a) Suppose G contains an isolated vertex, the degree of every non-isolated vertices is at most
n 2, and there are at most n 1 such vertices. According to the Handshaking Lemma, the
largest possible number of edges in G is (n1)(n2)
. It contradicts the fat there are at least
2
(n 1)(n 2)/2 + 1 edges in G. So, G cannot contain an isolated vertex.
(b) Since G is noth connected, deg(v)
n 2. Removing any vertex from G will result in a graph
i
(n1)(n2)
with at least
+ 1 (n 2) = (n2)(n3)
+ 1 edges.
2
2
(c) We prove this by induction:
(1) when n = 2, G has at least

(n1)(n2)
2

+ 1 = 1 edges, so G is connected;

(2) If G is connected when n = k 2. Suppose that G is not connected when n = k+1. Let v
be a vertex in G. We know G0 = G v has at least [(k+1)2][(k+1)3]
+ 1 = (k1)(k2)
+1
2
2
0
edges according to (b). So, based on induction assumption, G must be connected.
However, G is not connected, which means v must be an isolated vertex. But this
contradicts (a). So, when n = k + 1, G is still connected.
Based on (1) and (2), we can prove that G must be connected.