GATE CS 2026 (Forenoon) — Question 57

Discrete MathematicsCombinatorics (Counting Rules, Summation Formulas)NAT2 marksHard

Let \( G \) be an undirected graph, which is a path on 8 vertices. The number of matchings in \( G \) is ________. (answer in integer)
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Combinatorics (Counting Rules, Summation Formulas)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