Graph theory

A drawing of a graph.

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges, then called arrows, link two vertices asymmetrically; see Graph (discrete mathematics) for more detailed definitions and for other variations in the types of graph that are commonly considered. Graphs are one of the prime objects of study in discrete mathematics.

Refer to the glossary of graph theory for basic definitions in graph theory.


Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures.


In the most common sense of the term,[1] a graph is an ordered pair G = (V, E) comprising a set V of vertices (also called nodes or points) together with a set E of edges (also called links or lines), which are 2-element subsets of V (i.e. an edge is associated with two vertices, and that association takes the form of the unordered pair comprising those two vertices). To avoid ambiguity, this type of graph may be described precisely as undirected and simple.

Other senses of graph stem from different conceptions of the edge set. In one more generalized notion,[2] V is a set together with a relation of incidence that associates two vertices with each edge. In another generalized notion, E is a multiset of unordered pairs of (not necessarily distinct) vertices. Many authors call this type of object a multigraph or pseudograph.

All of these variants and others are described more fully below.

The vertices belonging to an edge are called the ends or end vertices of the edge. A vertex may exist in a graph and not belong to an edge.

V and E are usually taken to be finite, and many of the well-known results are not true (or are rather different) for infinite graphs because many of the arguments fail in the infinite case. The order of a graph is |V |, its number of vertices. The size of a graph is |E|, its number of edges. The degree or valency of a vertex is the number of edges that connect to it, where an edge that connects a vertex to itself (a loop) is counted twice.

For an edge {x, y}, graph theorists usually use the somewhat shorter notation xy.

Other Languages
አማርኛ: ሥነ ግራፍ
беларуская: Тэорыя графаў
čeština: Teorie grafů
dansk: Grafteori
Ελληνικά: Θεωρία γράφων
Esperanto: Grafeteorio
euskara: Grafo teoria
한국어: 그래프 이론
Bahasa Indonesia: Teori graf
íslenska: Netafræði
latviešu: Grafu teorija
lietuvių: Grafų teorija
Bahasa Melayu: Teori graf
монгол: Графын онол
Nederlands: Grafentheorie
日本語: グラフ理論
norsk: Grafteori
norsk nynorsk: Grafteori
português: Teoria dos grafos
sicilianu: Tiuria dî grafi
Simple English: Graph theory
slovenčina: Teória grafov
slovenščina: Teorija grafov
српски / srpski: Теорија графова
srpskohrvatski / српскохрватски: Teorija grafova
svenska: Grafteori
Türkçe: Çizge teorisi
українська: Теорія графів
Tiếng Việt: Lý thuyết đồ thị
吴语: 图论
粵語: 圖論
中文: 图论