The Number of Trees on n Vertices

Loading...
En provenance du cours de Shanghai Jiao Tong University
Discrete Mathematics
76 notes
Shanghai Jiao Tong University
76 notes
À partir de la leçon
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.

Rencontrer les enseignants

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

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.