Applications
Graph theory has a wide variety of applications. There are many fields of study that use graph theory to help them achieve and do a variety of tasks.
As mentioned before, graph theory is mostly used as a way to represent an arrangement of objects and the relationships between them (Wilson & Watkins, 1990)
.
When looking at the applications, keep that in mind.
Below is a list of links attached to specific fields of study. Note that this list isn't all inclusive. There are many more fields and areas of study that
use graph theory. This list simply represents a sample aimed to inform you about some applications of graph theory. If anything catches your eye, or peaks
your interest, go explore and learn more about that subject and how graph theory is used there.
The list above is a representative sample. Below is a link where you can explore and learn more about some of the applications.
http://www.coloring-book.co/?pageName=cover&pageNumber=0
Here is a table of sources for a more in-depth examination of graph theory and its applications. Feel free to explore these at your leisure.
| Title |
Reference |
| Graphs are their Uses |
Ore, O., & Wilson, R. J. (1990). Graphs and their uses (Vol. 34). Cambridge University Press. |
| Graph Theory in Operations Research |
Boffey, T. B. (1982). Graph theory in operations research. Scholium International. |
| Graph Algorithms. |
Even, S. (2011). Graph algorithms. Cambridge University Press. |
| Computers and Intractability |
Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). New York: wh freeman. |
| Computers and Intractability: A Guide to the Theory of NP-Completeness |
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to NP-completeness. |
| Algorithmic Graph Theory |
Gibbons, A. (1985). Algorithmic graph theory. Cambridge university press. |
| Algorithmic Graph Theory and Perfect Graphs |
Golumbic, M. C. (2004). Algorithmic graph theory and perfect graphs (Vol. 57). Elsevier. |
| The Traveling Salesman Problem |
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The traveling salesman problem. 1985. John Wiley&Sons, Essex, England. |
| Critical Path Analysis and Other Project Network Techniques |
Lockyer, K. G. (1984). Critical path analysis and other project network techniques. Pitman Publishing. |
| Discrete Mathematical Models, with Applications to Social, Biological, and Environmental problems |
Roberts, F. S. (1976). Discrete mathematical models, with applications to social, biological, and environmental problems. Prentice-Hall. |
| Graphs, Networks, and Algorithms |
Swamy, M. N., & Thulasiraman, K. (1981). Graphs, networks, and algorithms (Vol. 3). New York: Wiley. |
| Ten Applications of Graph Theory |
Walther, H. (2012). Ten applications of graph theory (Vol. 7). Springer Science & Business Media. |
| Chemical Graph Theory |
Trinajstic, N. (2018). Chemical graph theory. Routledge. |
| Computer networking: A Top-Down Approach Featuring the Internet |
Kurose, J. F. (2005). Computer networking: A top-down approach featuring the internet, 3/E. Pearson Education India. |
| Topological Graph Theory |
Gross, J. L., & Tucker, T. W. (2001). Topological graph theory. Courier Corporation. |
| Graphical Evolution |
Palmer, E. Graphical Evolution. 1985. |