Postcards from backstage: Katie and Semi-Eulerian Graphs
https://www.youtube.com/watch?v=dFvzUNMU1Lo
Publisher, Katie Steckles, Matt Parker (Standup Maths), Stimulus, Video, YouTube
Matt Parker and Katie Steckles talk about Semi-Eulerian Graphs (networks).
What conditions are required in a network to follow every edge without repeating?
9 October 2017 Edit: 9 October 2017
- Topics:
- Advanced, Graph Theory (Networks)
- Content Type:
- Publisher, Katie Steckles, Matt Parker (Standup Maths), Stimulus, Video, YouTube
- Australian Curriculum / General Mathematics
- Unit 3 Topic 3 Graphs and networks, Paths and cycles, ACMGM083 explain the meaning of the terms walk, trail, path, closed walk, closed trail, cycle,…, ACMGM085 explain the meaning of the terms Eulerian graph, Eulerian trail, semi-Eulerian graph,…, The definition of a graph and associated terminology, ACMGM078 explain the meanings of the terms: graph, edge, vertex, loop, degree of a vertex, sub…
- NSW Mathematics Standard Stage 6 Syllabus
- Networks, MS-N1 Networks and Paths, MS-N1.1 Networks, MS-N2 Network Concepts, MS-N2.1 Networks
Submit a correction to this link
Comments
How have you used this link in your classroom? Share your teaching ideas or leave a review about this link.
Sign in to leave a comment.
There are no comments for this link.