Category:Graph theory
Wikimedia Commons has media related to: Graph theoryGraph theory is the branch of mathematics that examines the properties of graphs. See glossary of graph theory for common terms and their definition.
Informally, a 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.
Resources:
- meta:Philip Greenspun illustration project. Creation and improvement of illustrations for Wikimedia.
- See the resource list at commons:Category:Charts.
(previous 200) (next 200)
Subcategories
This category has the following 16 subcategories, out of 18 total.
A
G
G cont.
I
M
N
O
R
T
Pages in category "Graph theory"
The following 183 pages are in this category, out of 203 total. Updates to this list can occasionally be delayed for a few days.
1
A
- Aczel's anti-foundation axiom
- Adjacency list
- Ancestral graph
- Assignment problem
- Assortative mixing
- Average path length
B
- Bicircular matroid
- Biconnected component
- Bivariegated graph
- Blossom (mathematics)
- Bose-Einstein condensation: a network theory approach
- Bottleneck traveling salesman problem
- Boxology
- Bridge (graph theory)
C
- Cage (graph theory)
- Centrality
- Cheeger constant (graph theory)
- Chemical graph theory
- Circle packing theorem
- Circuit rank
- Clique (graph theory)
- Clique cover
- Clique problem
- Clique-width
- Coates graph
- Col (game)
- Collaboration graph
- Complex network
- Complex network zeta function
- Conference graph
- Connected component (graph theory)
- Connected dominating set
- Connectivity (graph theory)
- Copying mechanism
- Core (graph theory)
- Covering (graph theory)
- Cut (graph theory)
- Cut vertex
- Cycle (graph theory)
- Cycle decomposition
D
- Degree (graph theory)
- Degree (mathematics)
- Degree distribution
- Dependency graph
- Discharging method (discrete mathematics)
- Discrete Laplace operator
- Distance (graph theory)
- Distance-regular graph
- Domatic number problem
- Dominating set
- Dominating set problem
E
- Edge contraction
- Edge-graceful labeling
- Edmonds matrix
- Erdős–Burr conjecture
- Erdős–Gyárfás conjecture
- Erdős–Rényi model
E cont.
- Erdős–Stone theorem
- Eulerian path
- Evolutionary graph theory
- Expander mixing lemma
- Extremal graph theory
F
- Factor graph
- Feedback arc set
- Feedback vertex set
- Fitness model
- Flow network
- Forbidden graph characterization
- Fork (topology)
- Fractal dimension on networks
- Frequency partition
G
- Gain graph
- Giant component
- Martin Charles Golumbic
- Graceful labeling
- Graph (data structure)
- Graph (mathematics)
- Graph center
- Graph coloring
- Graph cuts in computer vision
- Graph homomorphism
- Graph isomorphism
- Graph labeling
- Graph partition
- Graph property
- Graph rewriting
H
- Hamiltonian path
- Hamiltonian path problem
- Hanan grid
- Haven (graph theory)
- Hereditary property
- Hierarchical clustering: networks
- Homeomorphism (graph theory)
I
- Icosian Calculus
- Implication graph
- Incidence geometry (structure)
- Incidence matrix
- Independent set
- Independent set problem
- Induced path
- Induced subgraph isomorphism problem
- Instant Insanity
- Intersection array
- Intersection graph
- Interval chromatic number of an ordered graph
K
L
- Level structure
- Liquid schedule
- Logical graph
- Longest uncrossed knight's path
- Loop (graph theory)
- Lovász conjecture
M
M cont.
- Maximum common subgraph isomorphism problem
- Menger's theorem
- Metcalfe's law
- Minor (graph theory)
- Modular decomposition
- Multiple edges
- Mycielskian
N
- Neighbourhood (graph theory)
- Network (mathematics)
- Network analysis
- Network dynamics
- Network theory
- New digraph reconstruction conjecture
- Nullity (graph theory)
O
P
- Parry-Sullivan invariant
- Path (graph theory)
- Path cover
- Path decomposition
- Peripheral cycle
- Primal graph
- Pseudoforest
Q
R
- Ramsey's theorem
- Random geometric graph
- Random graph
- Random regular graph
- Rank (graph theory)
- Reconstruction conjecture
- Reference point
- Resistance distance
- Road coloring problem
- Robbins theorem
- Robertson–Seymour theorem
- Rooted graph
- Route inspection problem
S
- Saturation (graph theory)
- Semi-symmetric graph
- Seven Bridges of Königsberg
- Seven Bridges of Königsberg/key
- Shortcut model
- Shortest path problem
- Signed graph
- Small world routing
- Snake-in-the-box
- Spatial network
- State diagram
- Steiner points
- Strongly connected component
- Strongly regular graph
- Subgraph isomorphism problem
- Symmetric hypergraph theorem
- Szemerédi regularity lemma
T
- Tait's conjecture
- Tanner graph
- Tellegen's theorem
- Theorem on friends and strangers
- Topological sorting
Media in category "Graph theory"
This category contains only the following file.
Complete graph K9.sv...20,853 bytes
Link former page on this page
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
http://wikipedia.atpedia.jp/wiki/%E9%BA%BB%E5%A9%86%E8%B1%86%E8%85%90
-
http://wikipedia.atpedia.jp/wiki/%E7%94%9F%E4%B9%B3
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0