CSE8011 Graph Theory

HW1

1. Prove that √2 is irrational. (Proof by contradiction)

2. Prove that for an integer n, if n2 is odd, then n is odd. (Proof by contrapositive)
3. Let 𝐴1 , 𝐴2 , … , 𝐴𝑛 be any n sets, 𝑛 ≥ 1. Show that ̅̅̅̅̅̅̅̅̅̅̅̅̅
(⋃𝑛𝑘=1 𝐴𝑘 ) = ⋂𝑛𝑘=1 ̅𝐴̅̅𝑘̅ (Proof by
induction).
4. Show that in any simple graph there are always two vertices with exactly the same
degree.
5. Prove or disprove: The complement of a simple disconnected graph must be
connected.
6. Show that 𝑄3 is bipartite.
7. Determine which of the pairs are isomorphic. Give the correct permutation or
adjacency matrix.

8. Let 𝐺 be the graph with vertex set {1,...,15} in which i and j are adjacent if and only
their greatest common divisor exceeds 1. Count the components of 𝐺 and
determine the maximum length of a path in 𝐺.
9. Let 𝑑1 , … , 𝑑𝑛 be integers such that 𝑑1 ≥ ⋯ ≥ 𝑑𝑛 ≥ 0. Prove that there is a loopless
graph (with multiple edges allowed) with degree sequence 𝑑1 , … , 𝑑𝑛 if and only if
∑ 𝑑𝑖 is even and 𝑑1 ≤ 𝑑2 + ⋯ + 𝑑𝑛 .