Category:Graph theory
Pereiti į navigaciją
Jump to search
study of graphs, which are mathematical structures used to model pairwise relations between objects  | |||||
| Įkelti mediją | |||||
| Tai yra |
| ||||
|---|---|---|---|---|---|
| Poklasis | |||||
| Yra dalis | |||||
| Atradėjas arba išradėjas | |||||
| Susideda iš | |||||
| |||||
 | |||||
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.
Subkategorijos
Rodomos 36 subkategorijos (iš viso yra 36 subkategorijos).
*
A
- Graph (abstract data type) (1 F)
C
- Chemical graphs (5 F)
- Graph components (16 F)
- Cut (graph theory) (10 F)
D
- Degeneracy (graph theory) (5 F)
- Dominating set (graph theory) (12 F)
E
F
- Friendship paradox (2 F)
H
I
- Independent set (graph theory) (12 F)
- Graph isomorphism (16 F)
M
N
P
Q
- Quivers (graph theory) (8 F)
R
- Regular maps (65 F)
- Route inspection problem (4 F)
S
- Spanish graph theory glossary (16 F)
- Subgraphs (6 F)
T
- Traveling salesman problem (38 F)
V
- Vertex cover problem (14 F)
- Videos of graph theory (14 F)
W
📚
- Malayalam graphs (image set) (10 F)
Daugialypės terpės rinkmenos kategorijoje „Graph theory“
Rodoma 200 šios kategorijos rinkmenų (iš viso kategorijoje yra 412 rinkmenų).
(ankstesnis puslapis) (kitas puslapis)-
1-dimensional-range-query.svg 261 × 201; 21 KiB
-
2b.png 149 × 102; 3 KiB
-
2d block-mapping.png 522 × 438; 8 KiB
-
2OptVerfahren.png 216 × 186; 3 KiB
-
2uniformLattice37.pdf 1 275 × 1 650; 275 KiB
-
3c.png 133 × 107; 3 KiB
-
4,82coveringlattice.pdf 1 800 × 1 800; 235 KiB
-
4d.png 144 × 107; 3 KiB
-
5 room puzzle minimal.svg 512 × 268; 151 bytes
-
9x9 Sudoku graph neighbors (really fixed).svg 450 × 580; 23 KiB
-
-
A graph with cubicity 2.svg 481 × 361; 5 KiB
-
A hexad of regular maps.svg 620 × 700; 27 KiB
-
A planar embedding of G (Bx and By avoid each other).jpg 618 × 241; 24 KiB
-
A planar embedding of G (Bx and By overlap).jpg 571 × 272; 22 KiB
-
A graph theoretic approach to the optimal slot utilization problem for naval communication networks (IA agraphoreticppro1094538519).pdf 1 275 × 1 650, 60 puslapių; 1,72 MiB
-
Airports Network Map.png 6 230 × 3 444; 11,57 MiB
-
All Simple Graphs On Three Vertices.png 271 × 130; 4 KiB
-
ApplicationColoriaged'ungraphesimplePage23Image1.svg 600 × 80; 1 KiB
-
AriJoshPresentation.pdf 754 × 566, 22 puslapiai; 274 KiB
-
Barabasi Albert 1000nodes.png 1 046 × 956; 74 KiB
-
Barabasi albert graph.svg 1 350 × 450; 30 KiB
-
Basic terms in graph theory Bulgarian.png 600 × 600; 36 KiB
-
Best first search.gif 1 192 × 779; 323 KiB
-
Better-graph-cartesian-product-2.svg 765 × 615; 25 KiB
-
Bisected network.jpg 942 × 530; 91 KiB
-
Blanche Descartes snark.svg 2 500 × 2 500; 79 KiB
-
Boxicity.svg 747 × 384; 11 KiB
-
C.elegans-brain-network.jpg 1 024 × 768; 270 KiB
-
Captura de pantalla 2011-09-07 a las 18.45.20.png 455 × 211; 28 KiB
-
Captura de pantalla 2011-09-07 a las 18.48.09.png 451 × 257; 33 KiB
-
Captura de pantalla 2011-09-13 a las 00.34.39.png 542 × 134; 24 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.05.png 577 × 139; 22 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.14.png 569 × 131; 21 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.25.png 531 × 123; 18 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.26.png 520 × 256; 34 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.42.png 540 × 134; 24 KiB
-
Captura de pantalla 2011-09-13 a las 00.37.54.png 593 × 242; 70 KiB
-
Carro.JPG 579 × 466; 19 KiB
-
Carro2.JPG 749 × 351; 22 KiB
-
Casetta senza penna.jpg 179 × 260; 12 KiB
-
CayleyCatalan.png 2 073 × 1 083; 147 KiB
-
Centrality.svg 600 × 900; 476 KiB
-
Chromatic polynomial.png 200 × 531; 39 KiB
-
Ciclo em um grafo.png 570 × 286; 13 KiB
-
Circuit with two port and equivalent signal flow graph.png 3 601 × 3 601; 408 KiB
-
Clique-sum.svg 630 × 630; 7 KiB
-
Closest string problem visualized.pdf 1 275 × 1 650; 6 KiB
-
CompleteBipartite3D.svg 523 × 921; 7 KiB
-
Complex network degree distribution of random and scale-free.png 600 × 390; 10 KiB
-
Conectividad en grafos.png 1 590 × 384; 51 KiB
-
Construction of Dual Tiling Using Incircles.png 1 229 × 1 077; 174 KiB
-
CorrelationIconographyEsp.png 395 × 399; 44 KiB
-
Cotree t1.png 59 × 36; 432 bytes
-
Courbes maximalistes ou non passant par 2 et 3 points.JPG 689 × 942; 115 KiB
-
Crossing number inequality Ex1.svg 170 × 415; 1 KiB
-
Csx graf ut.jpg 693 × 661; 96 KiB
-
Cubo Teorema Euler.svg 840 × 118; 59 KiB
-
DA-men-optimality.png 1 723 × 2 000; 118 KiB
-
Deber matematicas.pdf 1 239 × 1 752, 11 puslapių; 355 KiB
-
-
Descriptive statistics of the web graph.pdf 1 754 × 1 239, 15 puslapių; 1,35 MiB
-
DiamondKG.pdf 775 × 625; 6 KiB
-
Different stable matchings.png 1 587 × 1 170; 65 KiB
-
DigrafoDiMultidigrafo.png 400 × 252; 5 KiB
-
Dimostrazione4 0.PNG 305 × 237; 9 KiB
-
Dimostrazione4 01.PNG 305 × 237; 7 KiB
-
Dimostrazione4 1.png 305 × 237; 13 KiB
-
Directed and Undirected.png 450 × 194; 22 KiB
-
Directed edge representing an asymetric relation.png 256 × 256; 9 KiB
-
Directed NetworkX Graph.png 515 × 389; 25 KiB
-
Dissociation number.pdf 458 × 447; 35 KiB
-
Dominated vertex.svg 468 × 468; 1 KiB
-
Edge graceful c5.svg 260 × 255; 12 KiB
-
EjemploCaminoPermitido.png 1 440 × 702; 53 KiB
-
English Wikipedia clickstream communities December 2018.png 6 025 × 5 297; 33,63 MiB
-
Erdős–Rényi model random graphs.pdf 958 × 718; 12 KiB
-
EsempioMultigrafo.png 400 × 278; 6 KiB
-
-
Even directed graph that is not Eulerian counterexample.svg 1 266 × 511; 19 KiB
-
-
-
Example of junction tree.png 640 × 480; 32 KiB
-
Exemple de diagramme de Voronoï.png 273 × 160; 7 KiB
-
Expression Graph Reduction.svg 372 × 524; 17 KiB
-
Fary-induction.svg 445 × 497; 8 KiB
-
Feedback arc set NP-completeness.svg 512 × 512; 3 KiB
-
FibboCube.png 838 × 319; 19 KiB
-
Fig1MPHF.jpg 601 × 915; 69 KiB
-
Find-hall-violator.svg 1 571 × 493; 27 KiB
-
Finding a Hall violator.pdf 539 × 220; 23 KiB
-
Finished (fully expanded) Amiko hydra.png 1 472 × 832; 34 KiB
-
Finite coxeter.png 2 346 × 780; 34 KiB
-
First graph.jpg 1 323 × 1 004; 81 KiB
-
Five room puzzle.png 1 025 × 540; 9 KiB
-
Fleischner's theorem.svg 558 × 450; 5 KiB
-
Fokszámsorozatok realizációja.png 642 × 342; 24 KiB
-
Force-wiki.jpg 706 × 439; 62 KiB
-
Fork-join computation.svg 903 × 100; 5 KiB
-
Functional graph.svg 675 × 513; 9 KiB
-
Gale-Shapley.gif 861 × 706; 254 KiB
-
Gallai–Edmonds decomposition.svg 750 × 429; 26 KiB
-
Gdansk graphs.png 2 968 × 1 098; 129 KiB
-
Gdansk river.jpg 1 928 × 2 948; 368 KiB
-
Gdansk with graph.png 554 × 817; 88 KiB
-
Generating basis closed surfaces.svg 850 × 850; 89 KiB
-
Geodesics moves (1).jpg 331 × 192; 10 KiB
-
Geodesics moves.jpg 916 × 532; 75 KiB
-
Gephi 0.9.1 Network Analysis and Visualization Software.png 1 397 × 871; 566 KiB
-
Gowers construction for lower bound of Szemeredi regularity lemma.gif 839 × 583; 811 KiB
-
Graaf gebieden.png 320 × 256; 6 KiB
-
Grafo Iustração.gif 4 165 × 2 633; 52 KiB
-
Grafos lista de adjacência.png 213 × 226; 4 KiB
-
Graph 2.PNG 472 × 274; 7 KiB
-
Graph book sample.gif 262 × 160; 6 KiB
-
Graph C.png 104 × 69; 735 bytes
-
Graph C6 ChromaticNumber.PNG 666 × 527; 11 KiB
-
Graph comparison.jpg 850 × 690; 112 KiB
-
Graph conductance.svg 491 × 304; 102 KiB
-
Graph cut binary.svg 189 × 249; 27 KiB
-
Graph cut ternary.svg 541 × 249; 30 KiB
-
Graph edge.png 960 × 720; 18 KiB
-
Graph isomorphism.svg 502 × 730; 19 KiB
-
Graph konigsberg with degree.png 300 × 300; 26 KiB
-
Graph Surface Model.svg 354 × 266; 32 KiB
-
Graph-matroid-n3.jpg 490 × 900; 39 KiB
-
Graph-preperiodic-orbit.png 1 779 × 1 039; 47 KiB
-
Graph-structured stack - Borneq.png 563 × 275; 22 KiB
-
Graph-structured stack 1 - jaredwf.png 251 × 209; 9 KiB
-
Graph-theory-tree001.svg 354 × 709; 8 KiB
-
Graph0.svg 279 × 264; 2 KiB
-
Graph12.svg 601 × 1 498; 36 KiB
-
GraphDatabase PropertyGraph.png 616 × 436; 160 KiB
-
Graphe de mouvement du cavalier 3x4.png 329 × 188; 34 KiB
-
Graphe k partitionable.png 800 × 300; 20 KiB
-
GraphK 3,3 Chromatic number.PNG 666 × 527; 12 KiB
-
Graphs that are not pairwise compatibility graphs 01.jpg 1 361 × 364; 108 KiB
-
GraphStream GraphUnderConstruction.png 571 × 197; 12 KiB
-
GraphStream SimpleStream.png 394 × 118; 7 KiB
-
Gráficas 2-cromáticas.png 960 × 720; 13 KiB
-
Gráficas 2-cromáticas.svg 512 × 384; 23 KiB
-
Hakimi nem fut végig.png 633 × 284; 13 KiB
-
Hakimi végigfut.png 578 × 480; 27 KiB
-
Hamilton-kör.jpg 901 × 289; 12 KiB
-
HaseIgel2.svg 744 × 475; 25 KiB
-
HaseIgel3.svg 744 × 367; 19 KiB
-
HCN-network.png 307 × 242; 6 KiB
-
HeisenbergCayleyGraph.png 533 × 423; 9 KiB
-
Hmm-backward-algorithm.png 419 × 442; 88 KiB
-
Human interactome.jpg 600 × 481; 95 KiB
-
HumanKnowledgeRelationships.svg 744 × 1 052; 21 KiB
-
HypercubeCycles.png 190 × 150; 5 KiB
-
I4m-tree-compose.svg 18 × 18; 6 KiB
-
I4m-tree-decompose.svg 18 × 18; 6 KiB
-
Icosian calculus iota.svg 731 × 684; 14 KiB
-
Icosian calculus iota2.svg 473 × 64; 11 KiB
-
In-degree distribution histogram.png 1 010 × 459; 14 KiB
-
Incidence list 1.svg 298 × 485; 23 KiB
-
Incidence list 2.svg 288 × 485; 20 KiB
-
Incidence matrix oriented.svg 208 × 305; 17 KiB
-
Indifference graph.svg 432 × 108; 4 KiB
-
Initial form of Amiko hydra (without expansion).png 1 472 × 832; 23 KiB
-
InterpersonalLocalBridge.jpg 930 × 613; 46 KiB
-
Isomorphie, Indizes.svg 1 056 × 702; 168 KiB
-
Jeux qui est-ce.png 346 × 209; 16 KiB
-
Junction-tree-example.gif 474 × 268; 7 KiB
-
Kalingrad with graph.png 729 × 538; 77 KiB
-
Kalingrad.jpg 2 937 × 2 002; 303 KiB
-
KirchhoffGraph1.png 1 000 × 1 000; 8 KiB
-
KirchhoffGraph2.png 1 000 × 1 000; 6 KiB
-
KirchhoffGraph3.png 1 000 × 1 000; 7 KiB
-
KirchhoffGraph4.png 1 000 × 1 000; 7 KiB
-
Kite Graph.svg 250 × 250; 4 KiB
-
Kneser graph KG(7,3).jpg 1 462 × 1 140; 126 KiB
-
KnotGraphTable.svg 470 × 350; 75 KiB
-
Konigsberg.jpg 2 937 × 2 012; 296 KiB
-
Konzewitsch-Graph.png 521 × 407; 18 KiB
-
Krausz-Partition 2.png 763 × 476; 22 KiB
-
Krausz-Partition 3.png 783 × 333; 12 KiB
-
Laves graph STL.stl 5 120 × 2 880; 1,86 MiB
-
Libro (grafeteorio).png 262 × 160; 5 KiB
-
Linear Algebra for graphs.pdf 1 754 × 1 239, 18 puslapių; 2,69 MiB
-
LinkCorrelation7.png 620 × 185; 41 KiB
-
LinkCorrelation9.png 309 × 359; 4 KiB
-
LinkCorrelation9esp.png 286 × 346; 18 KiB
-
LinkCorrelation9espbis.png 285 × 362; 4 KiB
-
Listahab.jpg 865 × 753; 29 KiB
-
Listas de adyacencia 1.JPG 383 × 194; 16 KiB
-
Listas de adyacencia.jpg 600 × 194; 41 KiB
-
Local-confluence.svg 369 × 333; 2 KiB
-
Log aC vs a 1 copy.jpg 1 542 × 1 079; 340 KiB
-
Logique5.jpg 258 × 321; 26 KiB
-
Lovász–Woodall conjecture.svg 750 × 719; 9 KiB
-
Lubeck.jpg 905 × 1 494; 75 KiB
-
Lumped cartesian coordinate model.svg 709 × 709; 128 KiB
-
Lumped cylindrical coordinate model.svg 567 × 567; 132 KiB
-
Lumped spherical coordinate model.svg 567 × 620; 127 KiB
-
Map coloring via graphs.png 464 × 380; 44 KiB
-
MarkovBlanket.png 264 × 299; 24 KiB
-
Matching Beispiel Qualifikationen.png 254 × 171; 5 KiB
.svg)
.jpg){kind=small}
.jpg)
_Amiko_hydra.png)
.jpg)
.png)
.jpg)
.png)
