File:Directed.svg
Appearance
![File:Directed.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/a/a2/Directed.svg/250px-Directed.svg.png)
Size of this PNG preview of this SVG file: 250 × 225 pixels. Other resolutions: 267 × 240 pixels | 533 × 480 pixels | 853 × 768 pixels | 1,138 × 1,024 pixels | 2,276 × 2,048 pixels.
Original file (SVG file, nominally 250 × 225 pixels, file size: 2 KB)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 19:50, 22 October 2022 | ![]() | 250 × 225 (2 KB) | Smasongarrison | slimmed down with svgomg // Editing SVG source code using c:User:Rillke/SVGedit.js |
11:09, 18 August 2007 | ![]() | 250 × 225 (4 KB) | BetacommandBot | Transwiki approved by: w:en:User:Sopoforic This image was copied from wikipedia:en. The original description was: Directed graph. graph { 1 -> 2; 2 -> 3; 3 -> 1; 3 -> 2; } Based on Image:Directed.png {{PD-self}} === File |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
- Adjacency algebra
- Ancestral graph
- Archimedean graph
- Assortative mixing
- Attributed graph grammar
- BF-graph
- Bidirected graph
- Bondage number
- Boundary (graph theory)
- Bouquet graph
- Cameron graph
- Category (mathematics)
- Centered tree
- Circular coloring
- Conference graph
- Conflict-free coloring
- Contact graph
- Convex bipartite graph
- Convex subgraph
- Cycle decomposition (graph theory)
- Degree diameter problem
- Dinitz conjecture
- Dipole graph
- Edge cycle cover
- Edmonds matrix
- Friendly-index set
- GReAT
- Graph (abstract data type)
- Graph (discrete mathematics)
- Graph energy
- Graph manifold
- Graph theory
- Hamiltonian coloring
- Homomorphic equivalence
- Incidence (graph)
- Interval chromatic number of an ordered graph
- Kittell graph
- Krackhardt kite graph
- Kronecker graph
- L(2,1)-coloring
- L(h, k)-coloring
- Linear graph grammar
- Livingstone graph
- Lollipop graph
- Magic graph
- Map (graph theory)
- Matching preclusion
- Matsushima's formula
- MaxDDBS
- Maximum common edge subgraph
- Maximum weight matching
- McLaughlin graph
- Min-plus matrix multiplication
- Multi-trials technique
- Null model
- Nullity (graph theory)
- Parry–Sullivan invariant
- Path coloring
- Periodic graph (graph theory)
- Perron number
- Randić's molecular connectivity index
- Rank-width
- Read's conjecture
- Saturation (graph theory)
- Seidel adjacency matrix
- Sims conjecture
- Single-entry single-exit
- Single pushout graph rewriting
- Smith graph
- State diagram
- Sylvester graph
- Symmetric hypergraph theorem
- Szymanski's conjecture
- Tadpole graph
- Trellis (graph)
- Tutte matrix
- Visibility graph analysis
- Walther graph
- Wang algebra
- XGMML
- Talk:Graph theory/Archive 1
- User:SilentGuy
- User:Zahakiel/Sandbox
- Template:Graph-stub
Global file usage
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on ba.wikipedia.org
- Usage on bg.wikipedia.org
- Usage on ca.wikipedia.org
- Usage on ckb.wikipedia.org
- Usage on da.wikipedia.org
- Usage on de.wikipedia.org
- Usage on el.wikipedia.org
- Usage on en.wikibooks.org
- Usage on en.wiktionary.org
- Usage on eo.wikipedia.org
- Usage on es.wikipedia.org
- Usage on et.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on fi.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on gl.wikipedia.org
- Usage on id.wikipedia.org
- Usage on it.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on ko.wikipedia.org
- Usage on ml.wikipedia.org
- Usage on ms.wikipedia.org
- Usage on no.wiktionary.org
- Usage on pt.wikipedia.org
- Usage on ro.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on ru.wiktionary.org
- Usage on simple.wikipedia.org
- Usage on sl.wikipedia.org
View more global usage of this file.