Scribd
Upload
7 views2 pages

Assignment 1

Uploaded by

F219061 Laiba Irfan
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
7 views2 pages

Assignment 1

Uploaded by

F219061 Laiba Irfan
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

National University

Of Computer & Emerging Sciences-CFD campus


__________________________________________________________________________________

Assignment #. 01
MT3001_Graph Theory_Fall 2024

Program: BSCS Instructor: Mr. Muhammad Shoaib


Section: 9A Deadline: 18/09/2024 02:00 PM

Guidelines for Submission:

1. You must submit your solution in first class of coming week. Submissions submitted after the due time shall
not be considered.
2. If you do not finish every part of a question, do not worry! You can still submit what you have done to get
marks based on your efforts.
3. In case of copied or plagiarized solution student will be awarded zero marks in all assignments and it will
affect your grade.

Questions
1. Draw 𝐶7 , 𝑊7 , 𝐾7 , 𝑎𝑛𝑑 𝐾7,7.
2. How many vertices does a regular graph of degree four with 10 edges have? Draw simple graph.
3. Write a Python program that takes a large degree sequence as input and performs the following tasks:
a) Check if the sequence is graphical using the Havel-Hakimi algorithm.
b) If the sequence is graphical, determine sum of degrees of vertices is even.
c) If the sequence is graphical, determine how many vertices have odd degrees and ensure that the
number of odd-degree vertices is even.
4. Show the isomorphism of simple graphs is an equivalence relation with the help of an example.
5. Find at least 4 simple graphs with 8 vertices that is isomorphic to its own complement.
6. For each of the following pairs of graphs, first list their degree sequences. Then decide whether they are
isomorphic or not. If not, say why. If they are, give a bijection on the vertices that preserves the edges,
and draw the unlabeled graph that represents the corresponding isomorphism class of graphs.

1|Page
Best of Luck
National University
Of Computer & Emerging Sciences-CFD campus
__________________________________________________________________________________

Assignment #. 01
MT3001_Graph Theory_Fall 2024

Program: BSCS Instructor: Mr. Muhammad Shoaib


Section: 9A Deadline: 18/09/2024 02:00 PM

2|Page
Best of Luck

You might also like