MERLOT Search - category=2548&sort.property=overallRating
http://www.merlot.org:80/merlot/
A search of MERLOT materialsCopyright 1997-2014 MERLOT. All rights reserved.Thu, 10 Jul 2014 09:16:57 PDTThu, 10 Jul 2014 09:16:57 PDTMERLOT Search - category=2548&sort.property=overallRatinghttp://www.merlot.org:80/merlot/images/merlot.gif
http://www.merlot.org:80/merlot/
4434Graph Theory Lessons
http://www.merlot.org/merlot/viewMaterial.htm?id=84776
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.Discrete Math Resources
http://www.merlot.org/merlot/viewMaterial.htm?id=363275
This site consists of examples, exercises, games, and other learning activities associated with the textbook, Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns and Games by Doug Ensley and Winston Crawley. Requires Adobe Flash player.Graph Theory: Trees
http://www.merlot.org/merlot/viewMaterial.htm?id=86622
This applet is part of a larger collection of lessons on graph theory. The focus of this particular applet is Trees. The user will explore full binary, ternary and n-ary trees, the relationship of parent and child, and depth-first and breadth-first traversal.Euler Circuits, Hamilton Circuits, Directed Graphs
http://www.merlot.org/merlot/viewMaterial.htm?id=86621
This applet is a component of a larger site on Graph Theory. It introduces Euler Circuits and Hamilton Circuits and provides opportunities to investigate their properties using Peterson software.Graph Theory: Spanning Trees
http://www.merlot.org/merlot/viewMaterial.htm?id=86623
This applet is part of a larger collection of lessons on graph theory. The focus of this particular applet is on Spanning Trees. The user will explore depth first and breadth first methods of developing spanning trees from a connected graph.Graph Theory Tutorials
http://www.merlot.org/merlot/viewMaterial.htm?id=86754
This is a series of short interactive tutorials introducing the basic concepts of graph theory. There is not a great deal of theory here, but enough will be taught to wet your appetite for more!Integer Optimization and the Network Models
http://www.merlot.org/merlot/viewMaterial.htm?id=80563
It covers integer and network optimization with numerical examples and applicationsApplied Discrete Structures
http://www.merlot.org/merlot/viewMaterial.htm?id=740675
Applied Discrete Structures by Al Doerr and Ken Levasseur is a free open content textbook in discrete mathematics. Originally published in 1984 & 1989 by Pearson, the book has been updated to include references to Mathematica and Sage, the open source computer algebra system. Contents:Front Matter: Contents and IntroductionChapter 1: Set Theory I Chapter 2: Combinatorics Chapter 3: Logic Chapter 4: More on Sets Chapter 5: Introduction to Matrix Algebra Chapter 6: Relations and Graphs Chapter 7: Functions Chapter 8: Recursion and Recurrence Relations Chapter 9: Graph Theory Chapter 10: Trees Chapter 11: Algebraic Systems Chapter 12: More Matrix Algebra Chapter 13: Boolean Algebra Chapter 14: Monoids and Automata Chapter 15: Group Theory and Applications Chapter 16: An Introduction to Rings and Fields Solutions to Odd-Numbered Exercises Prims Algorithm
http://www.merlot.org/merlot/viewMaterial.htm?id=74247
Interacive illustration of Prims algorithm.Teaching Euler's Formula on the first day of class on Graph Theory
http://www.merlot.org/merlot/viewMaterial.htm?id=857466
Starting Graph Theory with Euler's Formula.