Scribd
Upload
77 views2 pages

Problem Sheet-1

This document lists 27 practice problems related to graph theory. The problems cover topics such as: the number of graphs with a given number of vertices and edges; properties preserved under isomorphism; coloring properties related to maximum degree; properties of self-complementary graphs; existence of paths and cycles in graphs based on minimum degree; properties of complete bipartite graphs and the complete graph; decomposing graphs into paths or components; and identifying cut vertices and edges in specific graphs.

Uploaded by

Ankit Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
77 views2 pages

Problem Sheet-1

This document lists 27 practice problems related to graph theory. The problems cover topics such as: the number of graphs with a given number of vertices and edges; properties preserved under isomorphism; coloring properties related to maximum degree; properties of self-complementary graphs; existence of paths and cycles in graphs based on minimum degree; properties of complete bipartite graphs and the complete graph; decomposing graphs into paths or components; and identifying cut vertices and edges in specific graphs.

Uploaded by

Ankit Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PRACTICE PROBLEMS-1

MA-528 (GRAPH THEORY)

(1) Find the number of graphs on n-vertices. How many of them contain exactly
m-edges?
(2) Let G and H be graphs. Show that if G ∼ = H, then χ(G) = χ(H).
(3) Show that if a graph G has maximum degree less than or equal to k, then it is
(k + 1)-colorable, i.e., χ(G) ≤ k + 1.
(4) Let G and H be graphs. If φ : G → H is an isomorphism, then show that for any
v ∈ V (G),
G[NG (v)] ∼
= H[NH (φ(v))].
(5) Show that Hypercube graph Qn are bipartite for all n ≥ 1.
(6) Let G and H be graphs. Show that G ∼ = H if and only if Ḡ ∼= H̄.
(7) A graph is called self-complementary if it is isomorphic to its complement. Prove
that there are no self-complementary graph of order 3, but there are such graphs
of order 4 and 5.
(8) How many edges does a self complementary graph of order n have ?
(9) Let n = 4k, k ≥ 1. Let V1 , V2 , V3 and V4 are disjoint sets of cardinality k and
V = V1 t V2 t V3 t V4 . Define a graph G on vertex set V and edge set E =
A1 ∪ A2 ∪ A3 ∪ A4 ∪ A5 , where

A1 = {xy : x 6= y, x, y ∈ V1 }
A2 = {xy : x 6= y, x, y ∈ V2 }
A3 = {xy : x ∈ V1 , y ∈ V3 }
A4 = {xy : x ∈ V3 , y ∈ V4 }
A5 = {xy : x ∈ V4 , y ∈ V2 }.

Show that G is self complementary.


(10) Let G be a graph of minimum degree d. Show that
(a) G has a path of length d
(b) G has a cycle of length d + 1 (d ≥ 2).
(11) Prove that if a graph has exactly two vertices of odd degree, then there is a path
from one of them to other.
(12) Determine which complete bipartite graphs are complete graphs.
(13) Prove or disprove: if every vertex of a graph has degree 2, then G is a cycle.
(14) Prove that a graph with more than six vertices of odd degree cannot be decomposed
into three paths.
(15) Exercise 1.1.22 (Douglas B. West, Introduction to graph theory).
1
(16) Exercise 1.1.24 (Douglas B. West, Introduction to graph theory).
(17) Show that the Petersen graph has no cycle of length 7.
(18) Let G be graph with girth 4 in which every vertex has degree k. Prove that G
has at least 2k vertices. Determine all such graphs with exactly 2k vertices.
(19) Let G be graph with girth 5 in which every vertex has degree k. Prove that G
has at least k 2 + 1 vertices.
(20) Show that every graph with at least two vertices has two vertices of equal degree.
(21) How many 4-cycle are in Km,n ? (m, n ≥ 2).
(22) The boolean lattice BLn (n ≥ 1) is the graph whose vertex set is the set of
all subsets of [n], where two subsets X and Y are adjacent if their symmetric
difference has precisely one element.
(a) Draw BL1 , BL2 , BL3 and BL4 .
(b) Determine V (BLn ) and E(BLn ).
(c) Show that BLn is bipartite for all n ≥ 1.
(23) Show that the hypercube graph Qn and boolean graph BLn are isomorphic.
(24) Every graph with n vertices and k-edges at least (n − k)-components.
(25) Find out all cut vertices and cut edges of the following graphs.

(26) Determine whether the graph below decomposes into copies of P4 .

(27) Let G be graph. Show that either G is connected or Ḡ is connected.

You might also like