The main article for this
category is
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► Algebraic graph theory (1 C, 42 P)
C► Graph coloring (1 C, 53 P) ► Computational problems in graph theory (2 C, 46 P) ► Graph connectivity (34 P)
D► Graph data structures (27 P)
E► Graph enumeration (4 P) ► Extensions and generalizations of graphs (3 C, 15 P) ► Extremal graph theory (8 P)
| G► Geometric graph theory (2 C, 14 P) ► Graph description languages (9 P) ► Graph minor theory (27 P)
I► Graph invariants (1 C, 67 P)
M ► Mathematical chemistry (21 P) NO► Graph theory objects (3 C, 42 P)
| O cont.► Graph operations (1 C, 21 P)
RT► Theorems in graph theory (41 P) ► Graph theorists (1 C, 105 P) ► Topological graph theory (1 C, 29 P)
|
Pages in category "Graph theory"
The following 88 pages are in this category, out of 88 total. This list may not reflect recent changes (learn more).
- Glossary of graph theory
- Graph theory
- Daftar/Tabel -- graph theory topics
ABC- Centrality
- Cheeger constant (graph theory)
- Chemical graph theory
- Graph coloring
- Complex network zeta function
- Consensus dynamics
- Continuous graph
- Convex subgraph
- Copying mechanism
- Covering graph
- Cycle decomposition (graph theory)
- Cycle double cover
DE | E cont.- Edge-graceful labeling
- Erdős–Burr conjecture
- Erdős–Gyárfás conjecture
- Evolutionary graph theory
- Expander mixing lemma
FGH- Handshaking lemma
- Hereditarnia
- Hereditary property
- Homeomorphism (graph theory)
I- Icosian Calculus
- Icosian game
- Implicit graph
KL- Lovász conjecture
- Lovász number
| M- Markov chain
- Mathematical chemistry
- Maximum common edge subgraph problem
- Mixed graph
- Modular decomposition
- Multi-level technique
- Multi-trials technique
NPR- Random graph
- Random walk closeness centrality
- Reconstruction conjecture
- Resistance distance
S- Sequential dynamical system
- Seven Bridges of Königsberg
- Shortcut model
- Shortest path tree
- Single-entry single-exit
- Structural induction
- Sumner's conjecture
- Szemerédi regularity lemma
- Szymanski's conjecture
T- Table of the largest known graphs of a given diameter and maximal degree
- Transitive reduction
- Tree of primitive Pythagorean triples
UV |
