Number of spanning trees

Task number: 3925

Determine the number of spanning trees of the following graphs:

  • Variant

    \(C_m \oplus_e C_n\) (merge along an edge)

  • Variant

    \(C_m \oplus_e K_n\)

  • Variant

    \(K_m \oplus_e K_n\)

  • Variant

    \(K_n \div e\) (subdivide one edge)

  • Variant

    \(K_n \div E\) (subdivide all edges)

  • Variant

    \(2K_n\) (duplicate all edges in parallel)

  • Variant

    \(K_{m,n}\)

  • Variant

    \(K_{m,n} - e\)

  • Variant

    \(K_{m,n} \div E\)

Difficulty level: Moderate task
Reasoning task
Routine calculation training
Proving or derivation task
Cs translation
Send comment on task by email