GATE CS 2018 (Forenoon) — Question 53

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)NAT2 marksHard

Let \(G\) be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2, ..., 100. There is an edge between vertices \(u\) and \(v\) if and only if the label of \(u\) can be obtained by swapping two adjacent numbers in the label of \(v\). Let \(y\) denote the degree of a vertex in \(G\), and \(z\) denote the number of connected components in \(G\). Then, \(y + 10z =\) _____.
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group