 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 09 | | LINKS: |  | |
Pages: 1 2 3 4 [>>] | - Page 589 - Section 9.1
Graph Theory -- Here is a large collection of topics in graph theory listed in alphabetical order.
http://www.math.fau.edu/locke/graphthe.htm
(Added: Fri Jul 28 2006)
- Page 589 - Section 9.1
Groups & Graphs -- Groups & Graphs is a software package for graphs, geometric configurations, and combinatorial designs. Its website can be found here.
http://www.paddle.mb.ca/G&G/home.shtml
(Added: Fri Jul 28 2006)
- Page 589 - Section 9.1
1.4.10 Drawing Graphs Nicely -- Algorithms for drawing graphs in attractive and/or useful ways can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/drawing-graphs.shtml
(Added: Fri Jul 28 2006)
- Page 589 - Section 9.1
Games on Graphs -- An introduction to graphs and some of their applications is provided by the "This is MegaMathematics" site from Los Alamos National Laboratory here.
http://www.c3.lanl.gov/mega-math/workbk/graph/grbkgd.html
(Added: Fri Jul 28 2006)
- Page 589 - Section 9.1
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, 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, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 591 - Section 9.1
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, 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, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 592 - Section 9.1
Visualisation and Analysis of Directed Graphs in 3D -- A visualization of the Hollywood graph, as well as many other large graphs, can be found here.
http://www.cs.usyd.edu.au/~visual/valacon/gallery.htm
(Added: Fri Jul 28 2006)
- Page 592 - Section 9.1
Image Galley -- To see a collection of images of large graphs arising in a variety of applications, check out this site.
http://www.nd.edu/~networks/gallery.htm
(Added: Fri Jul 28 2006)
- Page 592 - Section 9.1
aiSee Example Graphs -- To see images of a wide variety of images of graphs modeling a wide range of applications, take a look at these examples offered by aiSee, a provider of graph layout software.
http://www.aisee.com/cgi-bin/examples
(Added: Fri Jul 28 2006)
- Page 593 - Section 9.1
The Erdös Number Project -- Information about the Erdös number of various people is maintained by the Erdös Number Project (which has also been selected as a Geek Site of the Day) run by Jerry Grossman of Oakland University.
http://www.oakland.edu/enp/
(Added: Fri Jul 28 2006)
- Page 593 - Section 9.1
Computing Science, Graph Theory in Practice: Part I -- You can find an interesting two-part article that appeared in the Computing Science section of the American Scientist that discusses the study of large graphs, including the Web graph, call graphs, collaboration graphs, acquaintanceship graphs, and collaboration graphs, here. Check out the links in the bibliography.
http://www.americanscientist.org/template/AssetDetail/assetid/14708
(Added: Fri Jul 28 2006)
- Page 593 - Section 9.1
Computing Science, Graph Theory in Practice: Part II -- You can find an interesting two-part article that appeared in the Computing Science section of the American Scientist that discusses the study of large graphs, including the Web graph, call graphs, collaboration graphs, acquaintanceship graphs, and collaboration graphs, here. Check out the links in the bibliography.
http://www.americanscientist.org/template/AssetDetail/assetid/14717
(Added: Fri Jul 28 2006)
- Page 594 - Section 9.1
Computing Science, Graph Theory in Practice: Part II -- You can find an interesting two-part article that appeared in the Computing Science section of the American Scientist that discusses the study of large graphs, including the Web graph, call graphs, collaboration graphs, acquaintanceship graphs, and collaboration graphs, here. Check out the links in the bibliography.
http://www.americanscientist.org/template/AssetDetail/assetid/14717
(Added: Fri Jul 28 2006)
- Page 594 - Section 9.1
The Oracle of Bacon at Virginia -- The Oracle of Bacon website at Virginia allows you to enter the name of any actor or actress and accordingly calculates the Bacon Number for that actor or actress.
http://oracleofbacon.org/
(Added: Fri Jul 28 2006)
- Page 594 - Section 9.1
Six Degrees of Kevin Bacon -- Some people claim that every actor from a movie made during the last 15 years can be connected to Kevin Bacon in six or fewer steps. You can learn more about this, and find additional links relating to this phenomenon, here.
http://oracleofbacon.org/
(Added: Fri Jul 28 2006)
- Page 594 - Section 9.1
Computing Science, Graph Theory in Practice: Part I -- You can find an interesting two-part article that appeared in the Computing Science section of the American Scientist that discusses the study of large graphs, including the Web graph, call graphs, collaboration graphs, acquaintanceship graphs, and collaboration graphs, here. Check out the links in the bibliography.
http://www.americanscientist.org/template/AssetDetail/assetid/14708
(Added: Fri Jul 28 2006)
- Page 594 - Section 9.1
Graph structure in the web -- The use of graph theory to study the Web is described in an article accessible here.
http://www9.org/w9cdrom/160/160.html
(Added: Fri Jul 28 2006)
- Page 597 - Section 9.2
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, 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, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 597 - Section 9.2
Graph Theory Glossary -- A large glossary of graph terminology, prepared by Chris Caldwell from various sources, can be found on this page. You should work through the interactive tutorials in graph theory.
http://www.utm.edu/departments/math/graph/glossary.html
(Added: Fri Jul 28 2006)
- Page 597 - Section 9.2
Graph Theory Lesson 9 -- A short lesson on bipartite graphs, complete with diagrams and an interactive applet can be found here. Work through the questions on the webpage. Also click on the 'up' road sign icon to see other graph theory lessons.
http://www.utc.edu/~cpmawata/petersen/lesson9.htm
(Added: Fri Jul 28 2006)
- Page 601 - Section 9.2
Gallery of Named Graphs -- To see depictions of important graphs and families of graphs, consult this Wikipedia page.
http://en.wikipedia.org/wiki/Gallery_of_named_graphs
(Added: Fri Jul 28 2006)
- Page 602 - Section 9.2
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, 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, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 602 - Section 9.2
Graph Theory Lesson 9 -- A short lesson on bipartite graphs, complete with diagrams and an interactive applet can be found here. Work through the questions on the webpage. Also click on the 'up' road sign icon to see other graph theory lessons.
http://www.utc.edu/~cpmawata/petersen/lesson9.htm
(Added: Fri Jul 28 2006)
- Page 605 - Section 9.2
Local Area Network -- To learn more about local area networks (LANs) consult this Wikipedia article.
http://en.wikipedia.org/wiki/LAN
(Added: Fri Jul 28 2006)
- Page 612 - Section 9.3
1.1.4 Graph Data Structures -- Various implementations of data structures for graphs, which allow a user to create and edit graphs so that various algorithms can be run on graphs, are available at the Stony Brook Algorithm Repository, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/graph-data-structures.shtml
(Added: Fri Jul 28 2006)
| |
Pages: 1 2 3 4 [>>] | |
