The Number of Trees on n Vertices

Do curso por Universidade de Shanghai Jiao Tong
Discrete Mathematics
52 ratings
Universidade de Shanghai Jiao Tong
52 ratings
Na lição
Spanning Trees
We discuss spanning trees of graphs. In particular we present Kruskal's algorithm for finding the minimum spanning tree of a graph with edge costs. We prove Cayley's formula, stating that the complete graph on n vertices has n^(n-2) spanning trees.

Conheça os instrutores

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.