ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be University) Assignment

Branch CSE & CSIT Programme B.Tech

Course Name INTRODUCTORY GRAPH THEORY Semester 2ND
Course Code CSE 1004 Academic Year 2024-25
Assignment- 1 Topic: Fundamental Concepts
Learning Level L1: Remembering L3: Applying L5: Evaluating
(LL) L2: Understanding L4: Analysing L6: Creating
Q’s Questions COs LL
Q1 Draw all non-isomorphic simple graphs of order 4. CO1 L3
Determine which pairs of graphs below are isomorphic.

Q2 CO1 L3

A graph is self-complementary if it is isomorphic to its complement. For all

self-complementary graphs of order n, n is
(a) A multiple of 4 (b) Even
Q3 CO1 L3
(c) Odd (d) Congruent 0 mod4 or 1 mod4
Justify your answer.
[GATE 2015, SET 2]
Q4 Prove or disprove: Every Eulerian bipartite graph has an even number of edges. CO1 L3
An ordered n-tuple (d1 , d 2 ,..., d n ) with d1  d 2  ...  d n is called graphic if
there exists a simple undirected graph with n vertices having degrees
d1 , d 2 ,..., d n respectively. Which of the following 6-tuples is NOT
Q5 GRAPHIC? Justify your answer. CO1 L3
(a) 1, 1, 1, 1, 1, 1 (b) 2, 2, 2, 2, 2, 2
(c) 3, 3, 3, 1, 0, 0 (d) 3, 2, 1, 1, 1, 0
[GATE 2014, SET 1]
A graph has 18 vertices and 40 edges. The vertex degrees are either 3, 4, or 5. CO1
Q6 L3
Exactly 6 vertices have degree 4. How many vertices have degrees 3 and 5?
A 3-regular bipartite graph G has one partite set containing 20 vertices. CO1
Q7 L3
Determine the size (number of edges) of G.
If every vertex degree in a simple graph of size 25 is at least 3, find the CO1
Q8 L3
maximum possible order of the graph.
Identfy the cut-edges and the cut-vertices in the graph

Q9 CO1 L3

Q10 If an n-vertex cycle is isomorphic to its complement, find the value of n. CO1 L3
 Let the average vertex degree in a n-vertex simple graph be v. Find the size
Q11 of the graph in terms of n and v. CO1 L3

Determine if the following graph can be decomposed into copies of P3 :

Q12 CO1 L3

Prove or disprove: The complement of a simple disconnected graph must be

Q13 CO1 L3
connected.
Show that any two non-adjacent vertices in the Petersen Graph have
exactly one common neighbor.

Q14
CO1 L3

.
Prove that the graphs below are all drawings of the Petersen graph:
:

Q15 CO1
L3

Q16 Draw a non-complete 3-regular simple graph. CO1 L3

Prove or disprove: Every simple digraph with n vertices has at least two vertices CO1
Q17 L3
with the same out-degree or two vertices with the same in-degree.
Q18 Show that a k-regular graph with n vertices has nk / 2 edges. CO1 L3
Show that if k is a positive integer, then a k-regular bipartite graph has the CO1
Q19 L3
same number of vertices in each partite set.
0 1 1 0 
0 0 0 1 
Q20 Draw a directed graph corresponding to the adjacency matrix   CO1 L3
0 0 0 1 
 
0 0 0 0 
Note:

1. The assignment carries a weightage of 10 marks out of 100

2. The course outcome CO1 is covered.

Able to understand the fundamental concepts of graphs and apply them to study graph
CO1 isomorphisms, Eulerian graphs, graphic sequences and digraphs.
Able to understand the concepts of trees, spanning trees and study its various concepts and
CO2 apply the Kruskal’s algorithm to find the minimum spanning tree and Dijkstra’s algorithm to find
the shortest path of connected weighted graphs.
Course CO3 Able to understand matchings and factorization of graphs and its various applications.
Outcomes Able to understand and analyze coloring of graphs, it’s enumerative aspects and its
CO4 applications.
CO5 Able to understand and analyze planar graphs and its various applications.
Able to understand the concepts of line graphs, edge-coloring and the various aspects
CO6 Hamiltonian cycles.