IIT Tirupati

Assignment 2-Basic Graph Theory

—————————————————————————————————————

1. Define a walk, a path and a circuit of a graph G. Provide some failure and successful
examples to each of them for a connected loop-less graph on 5 vertices having atleast
one vertex is of degree three atleast. Explain your answers clearly.

2. Prove or disprove that, a connected simple graph G contains a cycle if and only if
m(G) ≥ n(G).
n2
3. Can you assure that every simple graph with m > 4
contains a cycle of length 3.
Justify your answer with a detailed proof.

4. Define the diameter of a graph. Construct a graph having diameter 2 such that the
lengths of shortest paths between any two vertices is 1.
5. Prove that distance function d : V (G) × V (G) → R of a connected graph G is a
metric on V (G) .

6. Identify all the cut vertices and cut-edges of P5 , C5 and K5 , use vowels as the labels
of vertices. Explain each of your answer.

7. If given is a connected graph with n(G) ≥ 3 and e(u, v) is a cut-edge then either u
or v is a cut-vertex.
8. Prove or disprove that (1) every component is a block, (2) every block is a component.

9. Define edge connectivity and vertex connectivity of Graph. Can always 3-vertex
connected graph be 2-vertex connected and 4-vertex connected. Justify your anwers.

10. Find the edge connectivity of each loopless graph on 10 vertices without parallel
edges and having diameter two. Completely justfiy your answers.
11. Prove or disprove that if G is a simple graph, then G contains at least three ver-
tices whic are either mutually adjacent or mutually disjoint. Justfiy you answers
completely.
12. Let G be a simple graph on n vertices. Let k be a positive integer and 1 ≤ k ≤ n
 
n+k
. If degG (v) ≥ − 1 , for every vertex v of G, then prove that G is k-vertex
2
connected.
13. Prove that for any graph G on atleast two verices, κo (G) ≤ κ1 (G).
14. Prove that if G is a connected simple graph then the distance between vi and vj is
the smallest integer p(≥ 0) such that [Ap ]ij 6= 0. How important it is to have the
word connected here to prove the result.

1
15. Let k be a positive integer and 1 ≤ k ≤ n. Construct a non-simple graph on n
n+k
vertices satisfying degG (v) ≥ − 1 , for every vertex v of G, but κ0 (G) < k.
2
16. Find all the simple graphs G on n vertices satisfying diam(G) = 1.