The Number of Trees on n Vertices

Video placeholder
Loading...
View Syllabus

Reviews

3.2 (172 ratings)

  • 5 stars
    41.27%
  • 4 stars
    10.46%
  • 3 stars
    6.97%
  • 2 stars
    11.04%
  • 1 star
    30.23%

AG

Dec 4, 2018

This course is good to comprehend relation, function and combinations.

MY

Aug 8, 2017

Short course!! I use it to review my discrete math knowledge.

From the lesson

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.

Taught By

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.