16 Chapter 1.

An Introduction to Graphs

1.4.2 Let G be a graph in which there is no pair of adjacent edges. What can you say
about the degrees of the vertices in G?
1.4.3 Let G be a graph with n vertices and e edges and let m be the smallest positive
integer such that m > 2ejn. Prove that G has a vertex of degree at least m.

1.4.4 Prove that it is impossible to have a group of nine people at a party such that
each one knows exactly five of the others in the group.

1.4.5 Let G be a graph with n vertices, t of which have degree k and the others have
degree k + 1. Prove that t = ( k + 1)n - 2e, where e is the number of edges in G.

1.4.6 Let G beak-regular graph, where k is an odd number. Prove that the number
of edges in G is a multiple of k.

1.4.7 Let k be some positive integer, greater than 1. The k-cube, Qk, is the graph
whose vertices are the ordered k-tuples of O's and 1's, two vertices being joined
by an edge if and only if they differ in exactly one position. Thus, for example,
fork= 3 the vertices are (0,0,0), (0,0,1), (0,1,0), (1,0,0), {1,0,1), {1,1,0):
(0,1,1), (1,1,1) and, for example, (0,0,0) is joined to (0,0,1), (0,1,0) and
(1, 0, 0) but not to any other vertex. The 3-cube Q3 is shown in Figure 1.21.

3-cube

Figure 1.21: The 3-cube Q3.

(a) Show that the k-cube has 2k vertices, k2k-l edges and is bipartite.
(b) Using the bipartite property, draw a picture of the 4-cube Q 4 •

1.4.8 Let G be a graph with n vertices and exactly n - 1 edges. Prove that G has
either a vertex of degree 1 or an isolated vertex.

1.4.9 What is the smallest integer n such that the complete graph Kn has at least
500 edges?

1.4.10 Prove that there is no simple graph with six vertices, one of which has degree 2,
two have degree 3, three have degree 4 and the remaining vertex has degree 5.