CS2336 Discrete Mathematics

Homework 6
Exam 3: January 10, 2022

1. Let G be a graph with v vertices and e edges. Let M be the maximum degree of the
vertices of G, and let m be the minimum degree of the vertices of G. Show that

(a) 2e/v ≥ m
(b) 2e/v ≤ M

2. Show that in a simple graph with at least two vertices there must be two vertices that have
the same degree.

3. For each of the following graphs, determine whether it is bipartite.

(a) (b)

4. If G is a graph, the complement of G, denoted by G, is a graph with the same vertex set,
such that an edge e exists in G if and only if e does not exist in G.
Suppose it is known that a simple graph G has 15 edges and its complement graph G has
13 edges. How many vertices does G have?

5. Show that if G is a simple graph with n vertices, then the union of G and G is Kn .

6. Two graphs G and H are isomorphic if there is a one-to-one correspondence f between the
vertices of G and the vertices of H, such that u, v are adjacent in G if and only if f (u), f (v)
are adjacent in H. (See Lecture Note 13, pages 26 and 27 for some examples.)
Determine whether the following two graphs are isomorphic.
u1 v1
u8 u2 v8 v2

u7 u3 v7 v3

u6 u4 v6 v4
u5 v5

7. Suppose that G and H ae isomorphic simple graphs. Show that their complementary
graphs G and H are also isomorphic.

1
 8. Determine whether the following graphs is homeomorphic to K3,3 .

(a) (b) a
c l b
a b d
k c

j d

i e
f g h
e h f
g

9. Determine whether the following graph is planar. If so, draw it so that no edges cross.

a b c

d e f

10. The girth of a graph is the length of the smallest cycle in the graph; if there is no cycle,
the girth is defined as ∞. For example, the girth of the graph in Figure 1 is 5.
Let G be a finite, connected, simple, planar graph with V vertices and E edges. Suppose
that the girth of G is k. Show that E × (k − 2) ≤ k × (V − 2).

Figure 1: A graph with girth 5

Hint: Find an upper bound on F (the number of regions in a planar depiction of G), and
then apply Euler formula.

2
11. An undirected graph is called connected if there is a path between every pair of distinct
vertices of the graph, and a connected component of graph G is a maximal connected sub-
graph of G. For example, in the following graph, there are 3 connected components H1 ,
H2 , and H3 .

H1 H2 H3
d e
b f

a c h g

Suppose that a planar graph has k connected components, e edges, and v vertices. Also
suppose that the plane is divided into f regions by a planar representation of the graph.
Find a formula for f in terms of e, v, and k.