|Wikimedia Commons has media related to Graph theory.|
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).
This category has the following 23 subcategories, out of 23 total.
- ► Algebraic graph theory (2 C, 53 P)
- ► Graph databases (1 C, 19 P)
- ► Graph invariants (1 C, 92 P)
- ► Network theory (3 C, 95 P)
Pages in category "Graph theory"
The following 104 pages are in this category, out of 104 total. This list may not reflect recent changes (learn more).
- 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 homomorphism
- Graph isomorphism
- Graph property
- Graph removal lemma