GATEverse Practice, past papers & mock tests
GATE 2018
Engineering MathematicsGraph TheorymediumNAT2 marks
Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of 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 = _______
Save your progress

Related Engineering Mathematics PYQs