Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
49 views1 page

Birla Institute of Technology and Science-Pilani, Hyderabad Campus

This document provides instructions and questions for a Graphs & Networks comprehensive examination. It includes 5 questions related to graphs, trees, networks, and graph coloring. Students are instructed to answer all questions, label graphs properly, and show all steps for the max flow question. The questions address topics like properties of disjoint trees formed from another tree, conditions for a graph to be Hamiltonian, deriving a chromatic polynomial and number of colorings, properties of a regular planar graph with regions of specific degrees, and applying the max-flow min-cut theorem to a network.

Uploaded by

Mahi Chapli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views1 page

Birla Institute of Technology and Science-Pilani, Hyderabad Campus

This document provides instructions and questions for a Graphs & Networks comprehensive examination. It includes 5 questions related to graphs, trees, networks, and graph coloring. Students are instructed to answer all questions, label graphs properly, and show all steps for the max flow question. The questions address topics like properties of disjoint trees formed from another tree, conditions for a graph to be Hamiltonian, deriving a chromatic polynomial and number of colorings, properties of a regular planar graph with regions of specific degrees, and applying the max-flow min-cut theorem to a network.

Uploaded by

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

Birla Institute of Technology and Science-Pilani, Hyderabad Campus

Second Semester, 2016-2017


Comprehensive Examination (Part B)
(Open Book)
Course Code: MATH F243 Course Name: Graphs & Networks
Date: 10.05.2017 Day: Wednesday
Max Marks: 20 Time: 3.30 P.M. – 5.00 P.M.
____________________________________________________________________________________
Instructions: There are five questions. Answer all the questions. All graphs should be labeled properly. Different
colors ink can be used except red color. Marks for each question are given at the end of the question.
_______________________________________________________________________________________________
1. Two disjoint trees 𝑇1 and 𝑇2 are formed after removal of certain edge(s) from a tree 𝑇 of size 58. If
the number of edges in 𝑇1 and number of vertices in 𝑇2 are same, then find the order and size of 𝑇1
and 𝑇2 . [3]
1
2. Let 𝐺 be a connected graph of order 𝑛 and size 𝑚. Show that if 𝑛 ≥ 2 (𝑚2 − 3𝑚 + 6), then 𝐺 is
Hamiltonian. [4]
3. Let 𝐺 be a connected graph whose degree sequence is 2,2,3,3,4. Draw the graph 𝐺 and derive its
chromatic polynomial. Using chromatic polynomial, determine in how many ways 𝐺 can be colored
using 5 different colors. [4]
4. Let 𝐺 be a regular planar graph each of whose region is bounded by either 4 edges or 6 edges. Each
region of 4-edges is bounded by a region of 6-edges and vice-versa. Degree of each vertex of 𝐺 is 3.
Find the number of 4-edges and 6-edges region in 𝐺. [4]
5. Using max flow-min cut theorem, find a maximal flow and its value of the following network from
the source S to the sink T. Show that this flow is maximum. (Write all steps). [5]

---------------

1|Page

You might also like