Let 𝐺 be an undirected graph, which is a path on 8 vertices. The number of…
GATE · 2026 · CS · Set 1 · Computer Science & IT
Let 𝐺 be an undirected graph, which is a path on 8 vertices. The number of matchings in 𝐺 is ______. (answer in integer)
Attempted by 95 students.
Sign up free to check your answer
Sign up freeLoading lesson…