Department of Mathematics, IITM

Graph Theory
Assignment-3
Connectivity, Euler and Hamiltonian Graphs

(1) Give an example of a connected graph where every edge is a bridge.

(2) Show that every connected graph with n-vertices where every edge is a bridge has
exactly n − 1 edges.
(3) Show that if v is a cut-vertex of a graph G then v is not a cut-vertex of Gc .
(4) Give an example of a graph that has a cut-vertex but not a bridge.
(5) Find the vertex as well as edge connectivity of Ks,t .
(6) Give an example of a graph G such that κ(G) < λ(G) < δ(G).
(7) Show that for any v ∈ V (G) and any e ∈ E(G) of a graph G, κ(G) − 1 ≤ κ(G − v)
and λ(G) − 1 < λ(G − e) ≤ λ(G).
(8) For any three integers r, s, t with 0 < r ≤ s ≤ t, show that there is a graph G with
κ(G) = r, λ(G) = s and δ(G) = t.
(9) Prove or Disprove: If v is a cut-vertex of a graph G, then C(G − v) = C(G) + 1
where C(G) represents the number of components of G.
(10) Let G be a connected graph such that each edge of G belongs to a triangle in G.
Show that G has a spanning Eulerian subgraph.
(11) For what values of s, t does Ks,t
• have a Hamilton path?
• have a Hamilton cycle?
(12) Let G be a bipartite graph such that order of G is odd. Show that G is not
Hamiltonian.
(13) Draw a graph G such that G has 5 vertices, is bipartite, has no Euler cycle but
has a Hamilton cycle.
2

(14) Prove by induction that the maximum number of edges in an n-vertex, simple,
(n−1)(n−2)
non-Hamiltonian graph is 2
+ 1.
(15) Prove or Disprove : Every Eulerian bipartite graph has an even number of edges.
n−1
(16) Let n be an odd number such that n ≥ 3. Show that there are 2
edge-disjoint
Hamilton cycles in Kn .
(17) Give an example of a graph (Non-trivial) G such that the following holds:
(a) is both Hamiltonian and Eulerian
(b) is Hamiltonian but not Eulerian
(c) is Eulerian but not Hamiltonian
(d) neither Eulerian not Hamiltonian
(18) Find the closure of the following graph.