Gujarat Technological UniversitySummer 2026 Examination

GTU 3171611 Graph Theory and Combinatorics Summer 2026 Paper Solution & PDF

B.E. · IT Engineering · Semester 7 · Subject Code: 3171611
Download Official GTU PDF
Share:
Total Marks70 MarksExternal theory exam
Passing Marks23 Marks33% minimum cutoff
Exam Duration2.5 Hours2:30 PM – 5:00 PM
Paper Structure5 QuestionsWith internal OR choices
Jump toQ1Q2Q3Q4Q5

Question 1

14 MarksMedium
(a)
Define isolated vertex, pendant vertex and a null graph.
3 Marks
(b)

Define isomorphism. Determine whether the following pair of graphs are isomorphic.

4 Marks
(c)

Define Hamilton cycle. How many edge disjoint Hamilton cycles exist in the complete graph with seven vertices? Also draw the graph to show these Hamilton cycles.

7 Marks

Question 2

14 MarksMedium
(a)

Draw the two simplest non-planar graphs and also mention their properties.

3 Marks
(b)

Prove the statement, ”Every circuit has an even number of edges in common with any cut-set”.

4 Marks
(c)
For a Eulerian graph G, prove the following properties.
i)The degree of each vertex of G is even.
ii)G is an edge-disjoint union of cycles.
7 Marks
OR OPTION
(c)

Define prefix code. Obtain an optimal prefix code for the message ROAD IS GOOD. Indicate the code.

7 Marks

Question 3

14 MarksMedium
(a)
How can a binary search tree be used to sort a list of elements?
3 Marks
(b)

From seven consonants and five vowels how many sets consisting of four different consonants and three different vowels can be formed.

4 Marks
(c)
State and Prove max-flow and min-cut Theorem.
7 Marks
OR OPTION
(a)

Define edge vertex connectivity and edge connectivity. Give the relation between them.

3 Marks
(b)

In how many ways a team of 11 be chosen from 20 students of a class so that 2 particular students are always included and 5 are always excluded? [P.T.O.]

4 Marks
(c)

Write Kruskal’s algorithm for finding minimum spanning tree. Find the minimum spanning tree for the weighted graph shown below using Kruskal’s algorithm.

7 Marks

Question 4

14 MarksMedium
(a)
Explain Inclusion – Exclusion Principle.
3 Marks
(b)
What is Rook Polynomial? Explain expansion formula of it.
4 Marks
(c)

Apply Dijkstra’s algorithm to the digraph shown in figure and determine the shortest distance from vertex a to each of the other vertices in the graph.

GTU Graph Theory and Combinatorics (3171611) Summer 2026 Question 4(c) Diagram
7 Marks
OR OPTION
(a)
Describe Binomial Theorem.
3 Marks
(b)

Find the number of solutions to x1+ x 2+ x 3+ x 4=20,where x1 ≥ -5, x2 ≥ 3, x3 ≥ 0, x 4 ≥ 1.

4 Marks
(c)
Explain Catalan numbers with suitable examples.
7 Marks

Question 5

14 MarksMedium
(a)
Define de Bruijn graph.
3 Marks
(b)
Explain the Exponential Generating Function.
4 Marks
(c)
Solve the recurrence relation : an+4an-1+4an-2=8 for n≥2 and a0=1,a1=2.
7 Marks
OR OPTION
(a)
Define Derangements.
3 Marks
(b)

The number of bacteria in a culture is 1000(approximately)and this number increases 250%every two hours. Use a recurrence relation to determine the number of bacteria present after one day.

4 Marks
(c)
Solve the recurrence relation : an=3an−1−3an−2 n≥3,a0=a1=1,a2=2
7 Marks
College Exam Groups

Studying for Graph Theory and Combinatorics?

Circulate this solved paper with KaTeX formulas and 1-click AI step solvers to your batchmates on WhatsApp or Telegram.

About this Examination Paper & Attribution

Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Graph Theory and Combinatorics (Summer 2026, B.E. · IT Engineering, Sem 7). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.

Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.

Download PDF