Math · Network mathematicsVISUAL DISCOVERY 352 OF 1,100
Walk Counting
Explorer · about 8 minutes · a little curiosity goes a long way
Browse all adventures
For grown-ups
Today’s little discovery
The (i,j) entry of the square of an adjacency matrix counts length-two walks from i to j. A return walk in a complete graph chooses any different middle vertex.
Ask your learner to point to the part that supports their answer about walk counting. For graphs, matrices or probabilities with an adult, 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.- Wonder
- Guess
- Try it
- Discover
- Celebrate
HERE’S A LITTLE WONDER…
What does walk counting reveal about length-2 closed walks in complete graph?
A network carries routes, requirements or probability between its nodes. The (i,j) entry of the square of an adjacency matrix counts length-two walks from i to j.
No rush. Try an idea and see.Open Lesson to read the question, choose your idea, and continue.