Let 𝐺 be an undirected graph, which is a path on 8 vertices. The number of…

2026

Let 𝐺 be an undirected graph, which is a path on 8 vertices. The number of matchings in 𝐺 is ______. (answer in integer)

Attempted by 17 students.

Show answer & explanation

Correct answer: 34

For a path graph on nnn vertices, the number of matchings is:

image.png

Explore the full course: Gate Guidance By Sanchit Sir