GATEverse Practice, past papers & mock tests
GATE 2026 · CS1 - Forenoon
Engineering MathematicsCombinatoricshardNAT2 marks
Let G be an undirected graph, which is a path on 8 vertices. The number of matchings in G is ______. (answer in integer)
Save your progress

Related Engineering Mathematics PYQs