Assignment 4

TMA 316
Q1. Let G be a graph with more than one vertex. Prove the following are equivalent.
(i) G is a tree.
(ii) Each pair of vertices is connected by exactly one simple path.
(iii) G is connected; but G − e is disconnected for any edge e of G.
(iv) G is cycle-free, but if any edge is added to G then the resulting graph has exactly
one cycle.
Q2. Define the following graphs:
(i) Regular graph
(ii) Complete Graph
(iii) Bipartite graph
(iv) Complete Bipartite graph
Q3 Define Eule and Hamiltonian graphs with the help of suitable examples.

Q4. Prove that in a graph G the number of vertices having an odd degree is always
even.

Q5. A graph has 12 edges, two vertices of degree 3, two vertices of degree 4, and
other vertices of degree 5. Find the number of vertices in the graph.

Q6. A disconnected simple graph G (without self-loops and parallel edges) with n
( )( )
vertices and k components can have at most edges.

Q7. Define the following terms:

(i) Tree
(ii) Binary Tree
(iii) Full Binary Tree
(iv) Complete binary Tree