Definition
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 vertices V and a set of edges E (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...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bang-Jensen J, Gutin G (2000) Digraphs: theory, algorithms and applications. Springer monographs in mathematics. Springer, London. http://www.imada.sdu.dk/Research/Digraphs/
Berge C (1976) Graphs and hypergraphs. North-Holland mathematical library, vol 6. North-Holland Publishing Company, Amsterdam
Bishop CM (2006) Pattern recognition and machine learning. Springer, New York
Bondy JA, Murty USR (2007) Graph theory. Springer
Chudnovsky M, Robertson N, Seymour P, Thomas R (2006) The strong perfect graph theorem. Ann Math 164:51–229
Diestel R (2005) Graph theory, 3rd edn. Springer. http://www.math.uni - hamburg.de/home/diestel/books/graph.theory/GraphTheoryIII.pdf
Emden-Weinert T. Graphs: theory–algorithms–complexity. http://people.freenet.de/Emden-Weinert/graphs.html
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
Garey MR, Johnson DS, Stockmeyer LJ (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1:237–267
Gimbel J, Kennedy JW, Quintas LV (eds) (1993) Quo vadis, graph theory? North-Holland, Amsterdam/ New York
Harary F (1969) Graph theory. Addison-Wesley, Reading
Jensen TR, Toft B (1995) Graph coloring problems. Wiley, New York
Locke SC. Graph theory. http://www.math.fau.edu/locke/graphthe.htm
Lovász L, Plummer MD (1986) Matching theory. Annals of discrete mathematics, vol 29. North Holland, Amsterdam/New York
Mohar B, Thomassen C (2001) Graphs on surfaces. John Hopkins University Press, Baltimore
Robertson N, Seymour PD (2004) Graph minors. XX. Wagner’s conjecture. J Comb Theory Ser B 92(2): 325–357
Weisstein EW. Books about graph theory. http://www.ericweisstein.com/encyclopedias/books/GraphTheory.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
Jensen, T.R. (2017). Graphs. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_352
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_352
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering