Encyclopedia of Machine Learning

2010 Edition
| Editors: Claude Sammut, Geoffrey I. Webb


  • Tommy R. Jensen
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30164-8_352


Graph Theory is (dyadic) relations on collections specified objects. In its most common, a graph is a pair G = (V, E) of a (finite) set of verticesV and a set of edgesE (or links). Each edge e is a 2-element subset {u, v} of V , usually abbreviated as e = uv; u and v are called the endvertices of e, they are mutually adjacent and each is incident to e in G. This explains the typical model of a simple graph.

A directed graph or  digraph is a more general structure, in which the edges are replaced by ordered pairs of distinct elements of the vertex set V , each such pair being referred to as an arc. Another generalization of a graph is a hypergraph or “set-system” on V , in which the hyperedges may have any size. Various concepts in graph theory extend naturally to multigraphs, in which each pair of (possibly identical) vertices may be adjacent via several edges (respectively loops). Also studied are infinite graphs, for which the vertex and edge sets are not restricted to be...

This is a preview of subscription content, log in to check access.


  1. Bang-Jensen, J., & Gutin, G. (2000). Digraphs: theory, algorithms and applications. Springer monographs in mathematics, London: Springer. http://www.imada.sdu.dk/Research/Digraphs/
  2. Berge, C. (1976). Graphs and hypergraphs. North-Holland mathematical library (Vol. 6).Google Scholar
  3. Bishop, C. M. (2006). Pattern recognition and machine learning. Springer.Google Scholar
  4. Bondy, J. A., & Murty, U. S. R. (2007) Graph theory, Springer.Google Scholar
  5. Chudnovsky, M., Robertson, N., Seymour, P., & Thomas, R. (2006). The strong perfect graph theorem. Annals of Mathematics, 164, 51–229.MathSciNetMATHCrossRefGoogle Scholar
  6. Diestel, R. (2005). Graph theory (3rd ed.). Springer. http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/GraphTheoryIII.pdf
  7. Emden-Weinert, T. Graphs: theory–algorithms–complexity. http://people.freenet.de/Emden-Weinert/graphs.html.
  8. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A guide to the theory of NP-completeness. New York: Freeman.MATHGoogle Scholar
  9. Garey, M. R., Johnson, D. S., & Stockmeyer, L. J. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1, 237–267.MathSciNetMATHCrossRefGoogle Scholar
  10. Gimbel, J., Kennedy, J. W., & Quintas, L. V. (Eds.). (1993). Quo Vadis, graph theory? North-Holland.Google Scholar
  11. Harary, F. (1969). Graph theory. Reading: Addison-Wesley.Google Scholar
  12. Jensen, T. R., & Toft, B. (1995). Graph coloring problems. Wiley.Google Scholar
  13. Locke, S. C. Graph theory. http://www.math.fau.edu/locke/graphthe.htm.
  14. Lovász, L., & Plummer, M. D. (1986). Matching theory. Annals of discrete math (Vol. 29). North Holland.Google Scholar
  15. Mohar, B., & Thomassen, C. (2001). Graphs on surfaces. John Hopkins University Press.Google Scholar
  16. Robertson, N., & Seymour, P. D. (2004). Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B, 92(2), 325–357.Google Scholar
  17. Weisstein, E. W. Books about graph theory. http://www.ericweisstein.com/encyclopedias/books/GraphTheory.html.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Tommy R. Jensen
    • 1
  1. 1.Alpen-Adria-Universität KlagenfurtKlagenfurtAustria