Gujarat Technological University

Seat No.: ________ Enrolment No.
___________
GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3171611 Date:15/12/2021
Subject Name:Graph Theory and Combinatorics
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) List three situations from everyday life in which graphs arise naturally 03
(b) Write the degree of each vertex. 04
(c) Prove that the number of vertices of odd degree in a graph is always even. 07
Also, take any graph and verify it.
Q.2 (a) Define a regular graph and draw a regular graph of degree 3. 03
(b) Mention isolated vertex, pendant vertex, vertex having self-loop, vertex 04
having two edges incident on it.
(c) Describe Königsberg bridge problem 07

OR
(c) Prove that a simple graph with 𝑛 vertices and 𝑘 components can have 07
(𝑛−𝑘)(𝑛−𝑘+1)
most edges.
2
1
Q.3 (a) Show that the following graphs are not isomorphic. 03
(b) Obtain the incidence matrix and adjacency matrix for the following 04
graph. Do you see anything special in incidence matrix? Mention it.
(c) (1) Mention three walks from vertex A to E. 07

(2) Mention two closed walks from vertex B.
(3) Mention a path of maximum length.
(4) Does closed walk in (2) are circuits?
OR
Q.3 (a) Draw the graph after fusion of vertices a and b for the following graph. 03
2
(b) Draw (1) Spanning subgraph of G and (2) G-{u,w} 04
(c) Draw (1) 𝐺1 ∪ 𝐺2 (2) 𝐺1 ∩ 𝐺2 (3) 𝐺1 ⨁𝐺2 for the following graphs 07
Q.4 (a) When do you say two vertices 𝑢, 𝑣 connected? 03

State which of the following graphs connected? If disconnected then
mention the number of components.
(b) Prove that a connected graph G is an Euler graph if and only if it can be 04
decomposed into circuits.
(c) Let {4, 15, 25, 5, 8, 16} be the set of weights. Construct maximal optimal 07
tree by Huffman coding. Also, write prefix code of each number.
OR
Q.4 (a) Define prefix code. Which of the following are prefix code? 03
A={10, 0, 1101, 111, 1100}
B={000, 001, 01, 10, 11}
C={01, 0, 101, 10, 11}
(b) Prove that a tree with n vertices has n - 1 edges. 04
3
(c)(1) What is the degree of isolated vertex in a graph? 07
(2) What is the maximum degree of any vertex in a simple graph with
𝑛 vertices?
(3) What is the length of a path of an edge which is not a self-loop in a
graph?
(4) In a connected graph G if degree of all vertices is of even then what
type of graph is?
(5) What is the length of a Hamiltonian path in a connected graph of 𝑛
vertices?
(6) A simple graph in which there exists an edge between every pair of
vertices is called ---
(7) In any tree (with two or more vertices), there are at least --- pendant
vertices.
Q.5 (a) Find the number of solutions to x1 + x2 + x3 + x4 = 17, where 0 ≤ x1 ≤ 2, 03
0 ≤ x2 ≤ 5, 0 ≤ x3 ≤ 5, 2 ≤ x4 ≤ 6.
(b) Among 50 patients admitted to a hospital, 25 are diagnosed with 04
pneumonia, 30 with bronchitis, and 10 with both pneumonia and
bronchitis. Determine: (a) The number of patients diagnosed with
pneumonia or bronchitis (or both). (b) The number of patients not
diagnosed with pneumonia or bronchitis.
(c) (1) A traveling salesman wants to do a tour of all 50 state capitals. How 07
many ways can he do this?
(2) How many distinguishable ways can the letters of “computer” be
arranged? How about “discrete”
(3) How many parallelograms are formed when a set of 5 parallel lines
intersects a set of 4 parallel lines?
OR
Q.5 (a) What is the unique solution of the recurrence relation 𝑎𝑛+1 = 𝑑𝑎𝑛 where 03
𝑛 ≥ 0, 𝑑 is a constant? Find the unique solution of the recurrence relation
𝑎𝑛 = 7𝑎𝑛−1, where 𝑛 ≥ 1 and 𝑎2 = 98
(b) A large software development company employs 100 computer 04
programmers. Of them, 45 are proficient in Java, 30 in C#, 20 in Python,
six in C# and Java, one in Java and Python, five in C# and Python, and
just one programmer is proficient in all three languages above. Determine
the number of computer programmers that are not proficient in any of
these three languages.
(c) Find an exponential generating function for the number of permutations 07
with repetition of length 𝑛 of the set {𝑎, 𝑏, 𝑐}, in which there are an odd
number of 𝑎’s, an even number of 𝑏 ‘s, and any number of 𝑐’ s.

Gujarat Technological University

Uploaded by

Copyright:

Available Formats

Gujarat Technological University

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Gujarat Technological University

Uploaded by

Copyright:

Available Formats

Seat No.: ________ Enrolment No.

GUJARAT TECHNOLOGICAL UNIVERSITY

(c) Describe Königsberg bridge problem 07

(c) (1) Mention three walks from vertex A to E. 07

Q.4 (a) When do you say two vertices 𝑢, 𝑣 connected? 03

You might also like