Editing Graph theory (section)

{{about|sets of vertices connected by edges|graphs of mathematical functions|Graph of a function|other uses|Graph (disambiguation)}}
{{short description|Area of discrete mathematics}}
[[File:Example of simple undirected graph 3.svg|thumb|upright=0.8|A graph with 6 vertices and 7 edges]]

In [[mathematics]] and [[computer science]], '''graph theory''' is the study of ''[[graph (discrete mathematics)|graph]]s'', which are [[mathematical structures]] used to model pairwise relations between objects. A graph in this context is made up of ''[[Vertex (graph theory)|vertices]]'' (also called ''nodes'' or ''points'') which are connected by ''[[Glossary of graph theory terms#edge|edges]]'' (also called ''arcs'', ''links'' or ''lines''). A distinction is made between '''undirected graphs''', where edges link two vertices symmetrically, and '''directed graphs''', where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in [[discrete mathematics]].