Category:Graph theory SubcategoriesPages in category "Graph theory"Media in category "Graph theory"Navigation menuUpload mediaGND ID: 4113782-6Library of Congress authority ID: sh85056471NDL Auth ID: 00562641BNCF Thesaurus ID: 57127BabelNet ID: 00397107nReasonatorScholiaStatistics
Discrete mathematicsMatrix theorySubdivisions of mathematics
en:fr:en:fr:en:verticesedges
Category:Graph theory
Jump to navigation
Jump to search
Category Graph theory on sister projects: | |||||||||
---|---|---|---|---|---|---|---|---|---|
Wiktionary en: fr: | Wikibooks en: | Wikiversity fr: en: |
.mw-parser-output #wdinfoboxwidth:210px;font-size:95%;table-layout:fixed;padding:0.mw-parser-output #wdinfoboxcaptionmargin-left:0px;background-color:white.mw-parser-output #wdinfobox thvertical-align:top;word-wrap:break-word.mw-parser-output #wdinfobox tdword-wrap:break-word.mw-parser-output .taxontree-lcell,.mw-parser-output .wikidatainfobox-lcelltext-align:right;background-color:#cfe3ff;padding-left:0.4em;padding-right:0.4em;font-weight:bold.mw-parser-output .taxontree-fullcelltext-align:center.mw-parser-output .taxontree-hdrcelltext-align:center;background-color:#cfe3ff;padding-left:0.4em;padding-right:0.4em;font-weight:bold.mw-parser-output .taxontree-rcell.mw-parser-output .taxontree-row@media screen and (max-width:600px).mw-parser-output .wdinfo_nomobiledisplay:none;visibility:hidden;height:0.mw-parser-output .wdinfobox_horizontalwidth:100%!important;clear:both!important;display:block;column-count:4.mw-parser-output .wdinfobox_hidedisplay:none.mw-parser-output #wdcreatordisplay:none.mw-parser-output .wdcreator_showdisplay:block!important.mw-parser-output #wdinfo_taxon ullist-style:none;padding-left:0;margin-left:0;list-style-position:inside.mw-parser-output .wikidatainfoboxVN ul lilist-style:none;padding:0;margin:0.mw-parser-output .wikidatainfoboxVNpadding:0;margin:0
study of graphs, which are mathematical structures used to model pairwise relations between objects | |||
Upload media | |||
Wikipedia Wikiquote | |||
Instance of | academic discipline, academic major, area of mathematics | ||
---|---|---|---|
Subclass of | theory | ||
Part of | discrete mathematics, computer science | ||
Has part |
| ||
| |||
| |||
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.
*
► Graph theorists (16 C, 13 F)
A
► Graph (abstract data type) (1 F)
► Algebraic graph theory (2 C, 2 F)
► Graph algorithms (14 C, 256 F)
C
► Graph classes (8 F)
► Clustering coefficient (3 F)
► Graph coloring (8 C, 26 F)
► Graph components (15 F)
► Cut (graph theory) (8 F)
D
► Degeneracy (graph theory) (4 F)
► Graph (discrete mathematics) (4 F)
► Dominating set (graph theory) (12 F)
► Dual graphs (1 C, 39 F)
E
► Eulerian paths (2 C, 3 F)
G
► Geometric graph theory (1 C)
► Graph isomorphism (10 F)
► Graphs (graph theory) (16 C, 1 P, 341 F)
H
► Hamiltonian paths (4 C, 47 F)
I
► Independent set (graph theory) (10 F)
► Graph invariants (3 C, 2 F)
M
► Matching (graph theory) (1 C, 52 F)
► Matrix representation of graphs (2 C, 26 F)
N
► Network theory (3 C, 2 F)
P
► Graph products (22 F)
Q
► Quivers (graph theory) (6 F)
R
► Regular maps (44 F)
► Route inspection problem (3 F)
S
► Spanish graph theory glossary (16 F)
► Steiner tree problem (9 F)
► Subgraphs (6 F)
T
► Traveling salesman problem (29 F)
► Tutte polynomial (8 F)
V
► Vertex cover problem (13 F)
► Videos of graph theory (14 F)
W
► Water, gas, and electricity (graph theory) (1 C, 16 F)
ഗ
► ഗ്രാഫ് തിയറി (10 F)
Pages in category "Graph theory"
This category contains only the following page.
- Graph theory
Media in category "Graph theory"
The following 200 files are in this category, out of 560 total.
1-dimensional-range-query.svg
261 × 201; 21 KB
1241050dn1.png
482 × 296; 118 KB
1241050dn2.png
434 × 303; 70 KB
1241050dn3.png
375 × 289; 67 KB
1factor.svg
512 × 331; 5 KB
1ZWptAK23DThtwPCBLvYdOwh dXexBlU.jpg
282 × 229; 14 KB
2-opt wiki.png
271 × 349; 4 KB
2b.png
149 × 102; 3 KB
2d block-mapping.png
522 × 438; 8 KB
2factor.svg
512 × 331; 5 KB
2factorhamiltonian.svg
512 × 331; 5 KB
2factorK51.png
378 × 378; 26 KB
2factorK52.png
378 × 378; 26 KB
2OptVerfahren.png
216 × 186; 3 KB
2uniformLattice37.pdf
1,275 × 1,650; 275 KB
3-coloreable.png
960 × 720; 9 KB
3-leaf power.svg
468 × 333; 6 KB
3-partite graph with difference density.png
1,200 × 846; 124 KB
3c.png
133 × 107; 3 KB
3partitegraph.svg
512 × 512; 9 KB
3partitegraphn.png
680 × 680; 56 KB
3r1c well-covered.svg
756 × 468; 8 KB
3x3 grid graph haven.svg
243 × 243; 3 KB
4,82coveringlattice.pdf
1,800 × 1,800; 235 KB
4-cube-drawing.svg
591 × 590; 18 KB
4d.png
144 × 107; 3 KB
6n-graph3.svg
375 × 410; 8 KB
A graph and its deck as described in the Reconstruction conjecture of graph theory.jpg
693 × 311; 28 KB
Ageev 5X circle graph.svg
1,025 × 1,025; 10 KB
AlmostWheel3D.svg
533 × 325; 4 KB
AlmostWheel3DFolded.svg
533 × 325; 5 KB
Andrásfai graph And(6).svg
227 × 227; 4 KB
ApplicationColoriaged'ungraphesimplePage23Image1.svg
600 × 80; 1 KB
Aresta.png
338 × 583; 14 KB
AriJoshPresentation.pdf
755 × 566, 22 pages; 274 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
Basis loops.svg
425 × 425; 15 KB
BeispielMaximalerFluss1.png
1,080 × 480; 12 KB
BeispielMaximalerFluss2.png
1,080 × 480; 30 KB
BeispielMaximalerFluss3.png
1,080 × 480; 12 KB
BekryptisGrafas.png
191 × 208; 2 KB
Bidirected graph features.svg
414 × 207; 9 KB
BipartiteFinalWiki.png
1,215 × 529; 161 KB
BipartiteFirstWiki.png
1,215 × 529; 161 KB
Bisected network.jpg
942 × 530; 91 KB
Blanche Descartes snark.svg
2,500 × 2,500; 79 KB
Block graph.svg
351 × 225; 3 KB
Boxicity.svg
747 × 384; 11 KB
Brooks theorem 2.svg
620 × 428; 18 KB
Brooks theorem 3.svg
882 × 247; 9 KB
Brooks theorem 4.svg
690 × 258; 795 bytes
Brooks theorem 6.svg
615 × 420; 14 KB
Brooks theorem.svg
812 × 466; 48 KB
Butterfly multitree.svg
288 × 243; 13 KB
Butterfly network.svg
900 × 1,050; 15 KB
C.elegans-brain-network.jpg
1,024 × 768; 270 KB
Caminosmascortos.jpg
744 × 500; 77 KB
Captura de pantalla 2011-09-07 a las 18.45.20.png
455 × 211; 28 KB
Captura de pantalla 2011-09-07 a las 18.48.09.png
451 × 257; 33 KB
Captura de pantalla 2011-09-13 a las 00.34.39.png
542 × 134; 24 KB
Captura de pantalla 2011-09-13 a las 00.37.05.png
577 × 139; 22 KB
Captura de pantalla 2011-09-13 a las 00.37.14.png
569 × 131; 21 KB
Captura de pantalla 2011-09-13 a las 00.37.25.png
531 × 123; 18 KB
Captura de pantalla 2011-09-13 a las 00.37.26.png
520 × 256; 34 KB
Captura de pantalla 2011-09-13 a las 00.37.42.png
540 × 134; 24 KB
Captura de pantalla 2011-09-13 a las 00.37.54.png
593 × 242; 70 KB
Carro.JPG
579 × 466; 19 KB
Carro2.JPG
749 × 351; 22 KB
Catalan3trees.png
4,043 × 1,163; 42 KB
Catwords graph.png
458 × 319; 10 KB
CayleyCatalan.png
2,073 × 1,083; 147 KB
Centrality.svg
600 × 900; 476 KB
Chinesepostmanproblem.JPG
217 × 218; 6 KB
Chromatic sum of C6.jpg
204 × 262; 9 KB
Circuit with two port and equivalent signal flow graph.png
3,601 × 3,601; 408 KB
Circular-arc graph.svg
675 × 432; 3 KB
Clique expr tree.png
545 × 807; 35 KB
Clique-sum.svg
630 × 630; 7 KB
Clique-width construction.svg
585 × 765; 13 KB
CliqueRot.svg
1,162 × 684; 4 KB
Closest string problem visualized.pdf
1,275 × 1,650; 6 KB
Cograph example 1.png
190 × 241; 8 KB
Cograph example 2.png
312 × 241; 9 KB
Cograph g1.png
15 × 15; 345 bytes
Cograph g2.png
16 × 91; 680 bytes
Cograph g3.png
52 × 91; 2 KB
Cograph g4.png
202 × 91; 3 KB
Cograph g5.png
202 × 91; 4 KB
Combinatorial map dual example.svg
216 × 207; 11 KB
Combinatorial map example.svg
90 × 90; 11 KB
CompleteBipartite3D.svg
523 × 921; 7 KB
Complex network degree distribution of random and scale-free.png
600 × 390; 10 KB
Components.svg
511 × 277; 6 KB
Con1.jpg
514 × 259; 46 KB
Con2.jpg
708 × 1,215; 110 KB
Connected network.jpg
239 × 176; 13 KB
Connexe et pas connexe.svg
922 × 448; 25 KB
CorrelationIconographyEsp.png
395 × 399; 44 KB
Cotree and cograph.svg
702 × 270; 5 KB
Cotree t1.png
59 × 36; 432 bytes
Cotree t2.png
181 × 115; 3 KB
Cotree t3.png
267 × 200; 6 KB
Cotree t4.png
626 × 290; 14 KB
Cotree t5.png
626 × 368; 16 KB
Cover - Graph Theory Defined, v1.svg
2,719 × 2,000; 20 KB
Coxeter graph of PGL(Z).svg
97 × 54; 4 KB
Coxeter graph of sym group.svg
172 × 54; 10 KB
Cwc6.png
426 × 146; 17 KB
Cwg1.png
72 × 69; 2 KB
Cwg2.png
205 × 77; 4 KB
Cwg22.png
193 × 67; 5 KB
Cwg222.png
69 × 65; 3 KB
Cwg4.png
193 × 67; 5 KB
Cwg5.png
194 × 146; 10 KB
Cwg6.png
302 × 146; 14 KB
Cwg7.png
302 × 146; 14 KB
Cwg8.png
302 × 146; 14 KB
Cwg9.png
426 × 146; 15 KB
Cycled Directory Loop.svg
280 × 479; 22 KB
Cycles and minimal degree.svg
700 × 254; 3 KB
Cyclic Graph 1.svg
523 × 695; 7 KB
Cyclic Graph 2.svg
625 × 416; 11 KB
Cyclic-graph.svg
252 × 167; 18 KB
Dart graph.svg
335 × 230; 2 KB
Dcpp derivatives.png
800 × 493; 98 KB
Decision tree for 3-clique no arrowheads.svg
359 × 331; 40 KB
DeGroot Learning Convergent.svg
184 × 120; 13 KB
DeGroot Learning Non-Convergent.svg
184 × 117; 13 KB
Deletion-contraction.svg
443 × 328; 21 KB
Descartes snark subgraph.svg
450 × 296; 6 KB
Descriptive statistics of the web graph.pdf
1,754 × 1,239, 15 pages; 1.35 MB
Digraph thing.png
859 × 605; 40 KB
DigraphFinalWiki.png
838 × 721; 47 KB
Directed graph discrete volumes.svg
248 × 195; 6 KB
Directed medial graph example.svg
510 × 146; 30 KB
Discrete gradient multi surface inwards orientation.svg
337 × 301; 45 KB
Discrete gradient multi surface.svg
337 × 301; 45 KB
Discrete gradient path integral.svg
283 × 266; 22 KB
Discrete Mathematics Example Graph.png
176 × 128; 1 KB
Distance-hereditary construction hu.svg
450 × 399; 9 KB
Distance-hereditary construction.svg
450 × 399; 4 KB
Distance-hereditary graph.svg
252 × 216; 2 KB
Divisão do grafo.jpg
219 × 185; 18 KB
Dominance drawing.svg
252 × 252; 4 KB
Dominator control flow graph.svg
305 × 349; 1 KB
Dominator tree.svg
373 × 253; 2 KB
Domino graph.svg
200 × 280; 2 KB
Domrel.png
305 × 349; 2 KB
Domtree.png
373 × 253; 2 KB
Dualer-graph.svg
414 × 342; 8 KB
E7 graph.svg
800 × 800; 21 KB
E8 graph.svg
800 × 800; 110 KB
Edge contraction with multiple edges.svg
2,835 × 1,772; 45 KB
Edge contraction.svg
800 × 500; 36 KB
Edge contraction2.svg
800 × 500; 40 KB
Edmonds-example-t7.svg
100 × 288; 5 KB
EjemploCaminoPermitido.png
1,440 × 702; 53 KB
EjemplosFinal.png
546 × 193; 6 KB
EjemplosGrafos.png
632 × 93; 9 KB
English Wikipedia clickstream communities December 2018.png
6,025 × 5,297; 33.63 MB
Ens(Cyc(Ars)).png
500 × 300; 15 KB
Epsilon-regularity.png
428 × 452; 24 KB
Erdos generated network-p0.01.jpg
2,222 × 1,126; 60 KB
Erdős–Rényi model random graphs.pdf
960 × 720; 12 KB
ESPM equiv bool.png
200 × 200; 2 KB
ESPM equiv parti.png
300 × 200; 4 KB
Euler Circuit K5.gif
713 × 689; 101 KB
Example directed graph with paths.svg
283 × 213; 23 KB
Example directed graph with surfaces.svg
266 × 213; 29 KB
Example directed graph with volumes.svg
325 × 245; 23 KB
Example directed graph.svg
283 × 213; 15 KB
Example of defective colouring of a cycle on five vertices when d = 0, 1, 2.PNG
824 × 275; 8 KB
Example-of-vertex-traversal-process.jpg
493 × 660; 134 KB
Exchangeable random graph from graphon.png
1,697 × 1,505; 112 KB
Exemple de diagramme de Voronoï.png
273 × 160; 7 KB
Expression Graph Reduction.svg
372 × 524; 17 KB
Expression Graph.svg
524 × 372; 18 KB
Expression Tree.svg
524 × 372; 23 KB
Factor critical.svg
711 × 585; 5 KB
Fary-induction.svg
445 × 497; 8 KB
Fia-sss.png
701 × 275; 23 KB
FibboCube.png
838 × 319; 19 KB
Fibonacci-Graph.png
2,032 × 1,400; 35 KB
Fig1MPHF.jpg
601 × 915; 69 KB
Figure 28 Graph-Example including Bloutooth-Chat Servers in a classroom.png
960 × 720; 665 KB
Finite coxeter.png
2,346 × 780; 34 KB
First graph.jpg
1,323 × 1,004; 81 KB
Five room puzzle.png
1,025 × 540; 9 KB
Fleischner's theorem.svg
558 × 450; 5 KB
Fokszámsorozatok realizációja.png
642 × 342; 24 KB
Forbidden indifference subgraphs.svg
504 × 309; 5 KB
Force-wiki.jpg
706 × 439; 62 KB
Fork-join computation.svg
903 × 100; 5 KB
Functional graph.svg
675 × 513; 9 KB
G1 nlc.png
191 × 64; 4 KB
G2 nlc.png
191 × 64; 4 KB
G3 2 nlc.png
193 × 189; 12 KB
G3 nlc.png
193 × 189; 9 KB
Categories:
- Discrete mathematics
- Matrix theory
- Subdivisions of mathematics
(window.RLQ=window.RLQ||[]).push(function()mw.config.set("wgPageParseReport":"limitreport":"cputime":"1.924","walltime":"2.353","ppvisitednodes":"value":14229,"limit":1000000,"ppgeneratednodes":"value":0,"limit":1500000,"postexpandincludesize":"value":56587,"limit":2097152,"templateargumentsize":"value":16008,"limit":2097152,"expansiondepth":"value":22,"limit":40,"expensivefunctioncount":"value":7,"limit":500,"unstrip-depth":"value":0,"limit":20,"unstrip-size":"value":1441,"limit":5000000,"entityaccesscount":"value":14,"limit":400,"timingprofile":["100.00% 2312.867 1 -total"," 96.86% 2240.351 1 Template:Wikidata_Infobox"," 96.76% 2238.029 1 Template:Wikidata_Infobox/core"," 44.14% 1020.941 214 Template:Wikidata_Infobox/line"," 21.70% 501.922 1 Template:Wikidata_ID"," 20.04% 463.568 1 Template:Br_separated_entries"," 19.07% 440.955 200 Template:Wikidata_ID_line"," 5.99% 138.555 20 Template:Replace_text"," 4.63% 107.164 1 Template:Ifcategory"," 3.57% 82.455 1 Template:Flatlist"],"scribunto":"limitreport-timeusage":"value":"1.232","limit":"10.000","limitreport-memusage":"value":7104920,"limit":52428800,"cachereport":"origin":"mw1300","timestamp":"20190421231048","ttl":2592000,"transientcontent":false);mw.config.set("wgBackendResponseTime":436,"wgHostname":"mw1261"););