Staple here Reg.

#: ___________________ Section: ________ Name: _______________________________

Department: Department of Computing Program: _______________________________

Assignment – 2 (Solution)
Graph Theory

Announced Date: 23-Nov-23 Due Date: 30-Nov-23 Total Marks = 10

Teacher Name: Dr. Irfan Ahmed Usmani Marks Obtained = _____
(CLO_2: (Cognitive Level C3, i.e., Applying) (PLO_3, i.e., Problem Analysis))

Problem:
A vector 𝑣 is called a graphical vector if there exists a simple graph such that 𝑣 is the degree vector of
that graph. Thus [3, 3, 3, 1] is not a graphical vector.

(a) Demonstrate a theorem that gives a necessary and sufficient condition for a vector to be a
graphical vector.
Solution:

(b) Use the theorem to develop an algorithm to test whether an arbitrary vector with integer
components is a graphical vector.
Solution

Page 1 of 1