‹
EXPLORE · LISTEN · DISCOVER

Spanning Trees

Math · Connections and routesVISUAL DISCOVERY 345 OF 1,100

Spanning Trees

Explorer · about 8 minutes · a little curiosity goes a long way

Lesson details
Browse all adventures
For grown-ups
Today’s little discovery

Cayley’s formula counts n^(n−2) labeled spanning trees of a complete graph. The trees connect every vertex without including a cycle.

Ask your learner to point to the part that supports their answer about spanning trees. For vertices and edges, counting, explain unfamiliar ideas together before using the model.

This is a learning model. Try the take-home activity together.
Voice settings

Using Heart (en-US).

Saved voices download ahead of play for this activity. No lesson text is sent to a speech service.The sample plays once and does not change the Sound on/off setting.
Your adventure steps
  1. Wonder
  2. Guess
  3. Try it
  4. Discover
  5. Celebrate
01 / 05
Vertices: 5One labeled spanning tree among the total
A little wonder
HERE’S A LITTLE WONDER…

What does spanning trees reveal about spanning trees of complete graph?

Dots represent places and lines represent possible connections. Cayley’s formula counts n^(n−2) labeled spanning trees of a complete graph.

No rush. Try an idea and see.
Try it

Open Lesson to read the question, choose your idea, and continue.