Category:Graph theory
Appearance
study of graphs, which are mathematical structures used to model pairwise relations between objects | |||||
| Upload media | |||||
| Instance of |
| ||||
|---|---|---|---|---|---|
| Subclass of | |||||
| Part of | |||||
| Discoverer or inventor | |||||
| Has part(s) | |||||
| |||||
English: 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 graphs (disambiguation).
Resources:
- See the resource list at Category:Charts.
Subcategories
This category has the following 36 subcategories, out of 36 total.
*
A
B
- Graph bibliografy (11 F)
- Bouquet Graph (3 F)
C
- Chemical graphs (5 F)
D
F
- Friendship paradox (2 F)
G
I
M
N
O
Q
- Quivers (graph theory) (10 F)
R
- Regular maps (76 F)
- Route inspection problem (4 F)
S
T
- Topological graph theory (9 F)
- Traveling salesman problem (42 F)
V
- Videos of graph theory (17 F)
W
📚
- Malayalam graphs (image set) (10 F)
Media in category "Graph theory"
The following 200 files are in this category, out of 357 total.
(previous page) (next page)-
2uniformLattice37.pdf 1,275 × 1,650; 275 KB
-
3-partite hypergraph.png 196 × 213; 5 KB
-
4,82coveringlattice.pdf 1,800 × 1,800; 235 KB
-
4,82coveringlattice.svg 1,323 × 1,323; 844 bytes
-
5 room puzzle minimal.svg 512 × 268; 151 bytes
-
6V8ENetwork.png 601 × 827; 10 KB
-
9x9 Sudoku graph neighbors (really fixed).svg 402 × 530; 201 KB
-
A graph with cubicity 2.svg 481 × 361; 5 KB
-
A stepwise irregular graph.svg 200 × 168; 19 KB
-
ABC index.svg 305 × 313; 25 KB
-
Albertson index.svg 301 × 253; 23 KB
-
Ancestral graph.svg 345 × 344; 13 KB
-
Aronszajn tree.svg 784 × 575; 94 KB
-
Arrangement graph.svg 523 × 543; 24 KB
-
Asteroidal triple.svg 307 × 306; 8 KB
-
AT-free graph.svg 186 × 157; 7 KB
-
Average path length.svg 242 × 537; 28 KB
-
Barabasi Albert 1000nodes.png 1,046 × 956; 74 KB
-
Barabasi albert graph.svg 1,350 × 450; 30 KB
-
Basic terms in graph theory Bulgarian.png 600 × 600; 36 KB
-
Berge's theorem.svg 186 × 205; 8 KB
-
Best first search.gif 1,192 × 779; 323 KB
-
BF-graph.svg 303 × 299; 18 KB
-
Biclique-free graph.svg 181 × 535; 31 KB
-
Bipartite hypergraph.svg 173 × 186; 8 KB
-
Bipolar Orientation.svg 731 × 402; 20 KB
-
Bisected network.jpg 942 × 530; 91 KB
-
Bisimplicial vertex.svg 210 × 253; 12 KB
-
Blanche Descartes snark.svg 2,500 × 2,500; 79 KB
-
Bondage number.svg 418 × 234; 14 KB
-
Boxicity.svg 747 × 384; 11 KB
-
C.elegans-brain-network.jpg 1,024 × 768; 270 KB
-
C4-saturated graph.svg 281 × 243; 5 KB
-
Carro.JPG 579 × 466; 19 KB
-
Carro2.JPG 749 × 351; 22 KB
-
Casetta senza penna.jpg 179 × 260; 12 KB
-
Certified dominating all shadow.svg 198 × 196; 8 KB
-
Certified dominating set.svg 276 × 162; 10 KB
-
Circuit with two port and equivalent signal flow graph.png 3,601 × 3,601; 408 KB
-
Claw-free graph with sets highlighted.svg 188 × 195; 11 KB
-
Clique cover.svg 269 × 266; 16 KB
-
Coates graph.svg 422 × 248; 22 KB
-
Cocomparability graph.svg 517 × 219; 35 KB
-
Complement of the Fano plane.svg 233 × 213; 15 KB
-
CompleteBipartite3D.svg 523 × 921; 7 KB
-
Complex network degree distribution of random and scale-free.png 600 × 390; 10 KB
-
Conflict-free coloring.svg 131 × 178; 9 KB
-
Connected dominating set.svg 131 × 121; 5 KB
-
Construction of Dual Tiling Using Incircles.png 1,229 × 1,077; 174 KB
-
Cop number.svg 194 × 136; 6 KB
-
Core of a graph.svg 211 × 353; 15 KB
-
CorrelationIconographyEsp.png 395 × 399; 44 KB
-
Cotree t1.png 59 × 36; 432 bytes
-
Crossing number inequality Ex1.svg 170 × 415; 1 KB
-
Cubic path expansion.svg 1,083 × 720; 3 KB
-
Cubical graph with weights.png 500 × 500; 22 KB
-
Cubo Teorema Euler.svg 840 × 118; 59 KB
-
Cycle cover.svg 659 × 577; 15 KB
-
Cycle decomposition.svg 179 × 166; 5 KB
-
DA-men-optimality.png 1,723 × 2,000; 118 KB
-
DC spanning tree.svg 232 × 153; 11 KB
-
Degree diameter.svg 321 × 163; 13 KB
-
Degree-constrained spanning tree.png 649 × 368; 40 KB
-
Diameter illustration.svg 379 × 208; 26 KB
-
DiamondKG.pdf 775 × 625; 6 KB
-
Dicut.svg 172 × 170; 10 KB
-
DigrafoDiMultidigrafo.png 400 × 252; 5 KB
-
Dijoin.png 894 × 853; 87 KB
-
Dijoin.svg 186 × 186; 6 KB
-
Directed edge representing an asymetric relation.png 256 × 256; 9 KB
-
Directed square.svg 142 × 99; 4 KB
-
Double graph of C 5.svg 421 × 286; 20 KB
-
Dually chordal.svg 359 × 207; 14 KB
-
Edge-weighted graph.png 640 × 480; 20 KB
-
Efficient dominating set.svg 170 × 170; 6 KB
-
EjemploCaminoPermitido.png 1,440 × 702; 53 KB
-
English Wikipedia clickstream communities December 2018.png 6,025 × 5,297; 33.63 MB
-
Erdős–Rényi model random graphs.pdf 958 × 718; 12 KB
-
Even circuit theorem.svg 388 × 193; 7 KB
-
Even-hole-free graph.svg 145 × 341; 17 KB
-
Example of junction tree.png 640 × 480; 32 KB
-
Exemple de diagramme de Voronoï.png 273 × 160; 7 KB
-
Expression Graph Reduction.svg 372 × 524; 17 KB
-
Fan graphs.svg 268 × 270; 14 KB
-
Fary-induction.svg 445 × 497; 8 KB
-
Feedback arc set NP-completeness.svg 512 × 512; 3 KB
-
FibboCube.png 838 × 319; 19 KB
-
Find-hall-violator.svg 1,571 × 493; 27 KB
-
Finding a Hall violator.pdf 539 × 220; 23 KB
-
Finished (fully expanded) Amiko hydra.png 1,472 × 832; 34 KB
-
Finite coxeter.png 2,346 × 780; 34 KB
-
Five room puzzle.png 1,025 × 540; 9 KB
-
Fleischner's theorem.svg 558 × 450; 5 KB
-
Flow decomposition.svg 733 × 333; 46 KB
-
Fokszámsorozatok realizációja.png 642 × 342; 24 KB
-
Force-wiki.jpg 706 × 439; 62 KB
-
Fork-join computation.svg 903 × 100; 5 KB
-
Fractional dominating set.svg 272 × 260; 10 KB
-
Friendly index.svg 327 × 500; 28 KB
-
Gale-Shapley.gif 861 × 706; 254 KB
-
Gallai–Edmonds decomposition.svg 750 × 429; 26 KB
-
Gdansk graphs.png 2,968 × 1,098; 129 KB
-
Gdansk river.jpg 1,928 × 2,948; 368 KB
-
Gdansk with graph.png 554 × 817; 88 KB
-
Generating basis closed surfaces.svg 850 × 850; 89 KB
-
Geodesics moves (1).jpg 331 × 192; 10 KB
-
Geodesics moves.jpg 916 × 532; 75 KB
-
Gephi 0.9.1 Network Analysis and Visualization Software.png 1,397 × 871; 566 KB
-
Global dominating set.svg 282 × 141; 9 KB
-
Good spanning tree conditions.svg 392 × 435; 8 KB
-
Gowers construction for lower bound of Szemeredi regularity lemma.gif 839 × 583; 811 KB
-
Graaf gebieden.png 320 × 256; 6 KB
-
Graph book sample.gif 262 × 160; 6 KB
-
Graph C.png 104 × 69; 735 bytes
-
Graph coloring game.gif 500 × 500; 154 KB
-
Graph comparison.jpg 850 × 690; 112 KB
-
Graph deficiency.svg 212 × 258; 16 KB
-
Graph edge.png 960 × 720; 18 KB
-
Graph edit distance.svg 362 × 252; 15 KB
-
Graph Surface Model.svg 354 × 266; 32 KB
-
Graph-preperiodic-orbit.png 1,779 × 1,039; 47 KB
-
Graph-structured stack - Borneq.png 563 × 275; 22 KB
-
Graph-structured stack 1 - jaredwf.png 251 × 209; 9 KB
-
GraphDatabase PropertyGraph.png 616 × 436; 160 KB
-
Graphe de mouvement du cavalier 3x4.png 329 × 188; 34 KB
-
Graphs that are not pairwise compatibility graphs 01.jpg 1,361 × 364; 108 KB
-
GraphStream GraphUnderConstruction.png 571 × 197; 12 KB
-
GraphStream SimpleStream.png 394 × 118; 7 KB
-
Harmonic index.svg 275 × 274; 20 KB
-
HCN-network.png 307 × 242; 6 KB
-
HeisenbergCayleyGraph.png 533 × 423; 9 KB
-
Henson graph.svg 565 × 387; 29 KB
-
Highly irregular graph.svg 170 × 261; 16 KB
-
Hirotaka Graph.png 1,828 × 1,590; 522 KB
-
Hmm-backward-algorithm.png 419 × 442; 88 KB
-
Homogeneous graphs 2.svg 636 × 235; 33 KB
-
Homogeneous graphs fixed.svg 218 × 669; 32 KB
-
Homogeneous graphs labeled.svg 216 × 702; 32 KB
-
Homogeneous graphs.svg 226 × 667; 22 KB
-
Human interactome.jpg 600 × 481; 95 KB
-
HumanKnowledgeRelationships.svg 744 × 1,052; 21 KB
-
HypercubeCycles.png 190 × 150; 5 KB
-
I4m-tree-compose.svg 18 × 18; 6 KB
-
I4m-tree-decompose.svg 18 × 18; 6 KB
-
Icosian calculus iota.svg 731 × 684; 14 KB
-
Icosian calculus iota2.svg 473 × 64; 11 KB
-
Imbalance conjecture.svg 235 × 250; 9 KB
-
Implicit graph board.svg 659 × 404; 50 KB
-
Implicit graph cropped.svg 496 × 419; 24 KB
-
Implicit graph with description and visual, fixed.svg 1,142 × 640; 100 KB
-
Implicit graph with description and visual.svg 1,152 × 588; 100 KB
-
Implicit knight's move graph.svg 960 × 960; 24 KB
-
In-degree distribution histogram.png 1,010 × 459; 14 KB
-
Incidence poset.svg 521 × 269; 25 KB
-
Incidences in a graph.svg 220 × 213; 18 KB
-
Independence dominating set.svg 206 × 210; 12 KB
-
Independent dominating.svg 111 × 96; 4 KB
-
Indifference graph = unit interval graph.svg 432 × 144; 5 KB
-
Indifference graph.svg 432 × 108; 4 KB
-
Initial form of Amiko hydra (without expansion).png 1,472 × 832; 23 KB
-
Integral and Non-Integral graphs.svg 415 × 255; 14 KB
-
InterpersonalLocalBridge.jpg 930 × 613; 46 KB
-
Isomorphie, Indizes.svg 1,056 × 702; 168 KB
-
Jeux qui est-ce.png 346 × 209; 16 KB
-
Join operation on graphs C4 and K4.svg 242 × 245; 8 KB
-
Junction-tree-example.gif 474 × 268; 7 KB
-
Kneser graph KG(7,3).jpg 1,462 × 1,140; 126 KB
-
KnotGraphTable.svg 470 × 350; 75 KB
-
Konzewitsch-Graph.png 521 × 407; 18 KB
-
Kotzig.png 630 × 394; 44 KB
-
Kotzig.svg 355 × 186; 7 KB
-
Laminar set.svg 243 × 381; 21 KB
-
Laves graph STL.stl 5,120 × 2,880; 1.86 MB
-
Lexicographic product (higher quality).gif 853 × 480; 221 KB
-
Libro (grafeteorio).png 262 × 160; 5 KB
-
Linear forest.svg 191 × 192; 4 KB
-
LinkCorrelation9.png 309 × 359; 4 KB
-
LinkCorrelation9esp.png 286 × 346; 18 KB
-
LinkCorrelation9espbis.png 285 × 362; 4 KB
-
Local-confluence.svg 369 × 333; 2 KB
-
Log aC vs a 1 copy.jpg 1,542 × 1,079; 340 KB
-
Logique5.jpg 258 × 321; 26 KB
-
Longest path in a graph.svg 189 × 160; 5 KB
-
LowesCommon.png 344 × 293; 11 KB
-
Lubeck.jpg 905 × 1,494; 75 KB
-
Map coloring via graphs.png 464 × 380; 44 KB
-
MarkovBlanket.png 264 × 299; 24 KB
-
Matching preclusion.svg 417 × 211; 7 KB
-
Max-flow min-cut theorem.svg 800 × 350; 14 KB
-
Maxflow imagesegmentation result.png 576 × 576; 106 KB
-
Maximal Planar Graph K3+2K1 Circular.svg 715 × 881; 26 KB
-
Maximal Planar Graph K₃+2K₁.svg 715 × 881; 22 KB
-
Maximally matchable edges.svg 171 × 161; 4 KB
-
Maximum cardinality maximum weight matching.png 640 × 480; 21 KB
-
Maximum cardinality minimum weight matching.png 640 × 480; 21 KB
-
Maximum weight matching.png 640 × 480; 22 KB
-
MCES of 2 graphs.svg 274 × 164; 8 KB
-
MCIS of 2 graphs.svg 298 × 186; 8 KB
-
Medial graph alone.jpg 1,275 × 1,650; 300 KB

