Category:Graph theory Information
 |
Wikimedia Commons has media related to 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 25 subcategories, out of 25 total.
A
C
D
E
G
I
M
N
O
R
T
U
Pages in category "Graph theory"
The following 109 pages are in this category, out of 109 total. This list may not reflect recent changes ( learn more).
C
D
- Deficiency (graph theory)
- Degree (graph theory)
- Degree distribution
- Deletion–contraction formula
- Dense subgraph
- Directed graph
- Discharging method (discrete mathematics)
- Discrete Laplace operator
- Distance (graph theory)
- Distance oracle
- Distinctiveness centrality
- Dominator (graph theory)
- Dot product representation of a graph
F
G
- Glossary of graph theory terms
- Goldberg–Seymour conjecture
- Graph (abstract data type)
- Graph (discrete mathematics)
- Graph algebra
- Graph amalgamation
- Graph canonization
- Graph dynamical system
- Graph edit distance
- Graph entropy
- Graph equation
- Graph Fourier Transform
- Graph homology
- Graph homomorphism
- Graph isomorphism
- Graph property
- Graph removal lemma
- Graph Theory, 1736–1936
- GraphCrunch
- Graphon