Category:Graph theory
Graph theory is the branch of mathematics that examines the properties of mathematical graphs. See glossary of graph theory for common terms and their definition.
Informally, this type of graph is a set of objects called vertices (or nodes) connected by links called edges (or arcs), which can also have associated directions. Typically, a graph is depicted as a set of dots (i.e., vertices) connected by lines (i.e., edges), with an arrowhead on a line representing a directed arc.
Such graphs can be used to represent and analyze a variety of systems and problems, including colorability problems, shortest path algorithms and spanning trees.
For information on other types of graphs see graph (disambiguation).
Subcategories
This category has the following 26 subcategories, out of 26 total.
*
A
C
- Graph connectivity (37 P)
D
- Graph distance (17 P)
E
- Graph enumeration (3 P)
- Extremal graph theory (18 P)
F
- Fractional graph theory (4 P)
G
- Graph description languages (11 P)
- Graph minor theory (33 P)
- Graph theory journals (5 P)
I
M
N
O
R
- Graph rewriting (11 P)
T
Σ
- Graph theory stubs (93 P)
Pages in category "Graph theory"
The following 101 pages are in this category, out of 101 total. This list may not reflect recent changes.
C
D
F
G
- Graph (abstract data type)
- Graph (discrete mathematics)
- Graph algebra
- Graph amalgamation
- Graph canonization
- Graph dynamical system
- Graph edit distance
- Graph entropy
- Graph equation
- Graph flattenability
- Graph Fourier transform
- Graph homology
- Graph homomorphism
- Graph isomorphism
- Graph of a polytope
- Graph property
- Graph Theory, 1736–1936
- GraphCrunch
- Graphical game theory
- Graphon