Task number: 3844

How many different graphs can be obtained by adding one new edge to a predefined tree on 10 vertices? Assume distinguished vertices, so we count the isomorphic graphs as distinct.

  • 45
  • 36
  • 9
  • Solution

    A tree on 10 vertices has 9 edges, the new edge can be added in \( \binom{10}2-9 = 36 \) ways.

  • Answer

    The correct answer is b.

Difficulty level: Easy task (using definitions and simple reasoning)
Routine calculation training
Cs translation
Send comment on task by email