The applets contain topics typically found in undergraduate graph theory and discrete structures classes like null graphs, the handshaking lemma, isomorphism, complete graphs, subgraphs, regular graphs, platonic graphs, adjacency matrices, graph coloring, bipartite graphs, simple circuits, Euler and Hamilton circuits, trees, unions and sums of graphs, complements of graphs, line graphs, spanning trees, plane graphs, shortest paths, minimal spanning trees. The applet utilizes Petersen software written by the author. Peterson can draw, edit and manipulate simple graphs, examine properties of the graphs, and demonstrate them using computer animation.
Lesson 1: Null graphs
Lesson 2: Handshaking Lemma
Lesson 3: Isomorphism
Lesson 4: Complete Graphs, Subgraphs
Lesson 5: Regular Graphs
Lesson 6: Platonic Graphs
Lesson 7: Adjacency Matrices
Lesson 8: Graph Coloring
Lesson 9: Bipartite Graphs
Lesson 10: Stars and Tripartite Graphs
Lesson 11: Circuits and Wheels
Lesson 12: Euler Circuits, Hamilton Circuits and Directed Graphs
Lesson 13: Trees and Searches
Lesson 14: Unions and Sums
Lesson 15: Complements
Lesson 16: Prisms
Lesson 17: Laces
Lesson 18: Line Graphs
Lesson 19: Grids
Lesson 20: Spanning Trees
Lesson 21: Planar Graphs
Lesson 22: Dual Graphs
Lesson 23: Weighted Graphs, Shortest Paths, and Minimal Spanning Trees
No comments:
Post a Comment