This task has not been reviewed, its validity can be dubious.

Prüfer codes

Task number: 4237

Find the spanning trees of the complete graph on \( n \) vertices with the following Prüfer code:

  • Variant

    22222222 (i.e. \(n = 10\)).

  • Variant


  • Variant

    12121212 (again \(n = 10\), or generalize).

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