File:Encoder Disc (3-Bit).svg
From Wikipedia, the free encyclopedia
Encoder_Disc_(3-Bit).svg (SVG file, nominally 284 × 284 pixels, file size: 6 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 | 02:57, 22 May 2006 | 284 × 284 (6 KB) | Jjbeard | {{Information| |Description=An Encoder Disc with a 3-Bit Reflected Gray Code |Source=Replacement for Image:Encoder_disc.png |Date=22/05/06 |Author=jjbeard |Permission=PD |other_versions=Image:Encoder_disc.png }} [[Category:Electrical_Engineerin |
File usage
More than 100 pages link to this file. The following list shows the first 100 page links to this file only. A full list is available.
- 3-opt
- AF-heap
- Algebraic combinatorics
- Algebraic enumeration
- Analytic combinatorics
- Arborescence (graph theory)
- Bondy's theorem
- Broken space diagonal
- Cake number
- Cameron–Erdős conjecture
- Circuit rank
- Circular coloring
- Colored matroid
- Combinatorial explosion (communication)
- Combinatorial hierarchy
- Combinatorics on words
- DIMACS
- Degree-constrained spanning tree
- Dinitz conjecture
- Dipole graph
- Disjunction property of Wallman
- Disperser
- Edge-matching puzzle
- Edge cycle cover
- Edmonds matrix
- Enumerative combinatorics
- Euclidean shortest path
- Exact coloring
- Extremal combinatorics
- Family of sets
- Fraysseix–Rosenstiehl's planarity criterion
- Freiheitssatz
- Fuzzy transportation
- Geometric combinatorics
- Giant component
- Graph enumeration
- Graph product
- Graph toughness
- Graph traversal
- Gray code
- Greedy randomized adaptive search procedure
- Hamming graph
- Higher spin alternating sign matrix
- Higman's lemma
- Hoffman–Singleton graph
- Honest leftmost branch
- Incidence list
- Independence system
- Induced subgraph isomorphism problem
- Intersection array
- Johnson graph
- K-edge-connected graph
- K-vertex-connected graph
- Kalmanson combinatorial conditions
- Levi's lemma
- Lieb's square ice constant
- Markov spectrum
- Maximal intersecting family
- Menger's theorem
- Milliken–Taylor theorem
- Modular product of graphs
- Monochromatic triangle
- Null move
- Pandiagonal magic cube
- Pantriagdiag magic cube
- Path coloring
- Q-theta function
- Quasi-polynomial
- Random geometric graph
- Random minimal spanning tree
- Ranked poset
- Reachability
- Regular Hadamard matrix
- Rooted graph
- Rotary encoder
- Rule of product
- Schnyder's theorem
- Semiperfect magic cube
- Shannon switching game
- Shortest path tree
- Spherical design
- Squarefree word
- Steiner points
- Symmetric design
- Szekeres snark
- T-theory
- Transportation network (graph theory)
- Transpose graph
- Transversal (combinatorics)
- Tree spanner
- Tucker's lemma
- Tutte matrix
- Tutte theorem
- Tutte–Berge formula
- Unique sink orientation
- Visibility graph analysis
- Weak coloring
- Weighing matrix
- Wilf–Zeilberger pair
- Wythoff's game
Global file usage
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on bg.wikipedia.org
- Usage on bs.wikipedia.org
- Usage on en.wikibooks.org
- Usage on es.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on sv.wikipedia.org
- Kombinatorik
- Probabilistisk grafteori
- Permutation
- Cyklisk permutation
- Pascals triangel
- Cyclic Redundancy Check
- Wikipedia:Layoutlista över stubbmallar
- Dirichlets lådprincip
- Graykod
- Kuratowskis sats
- Komponent (grafteori)
- Mall:Kombinatorikstub
- Catalantal
- Hashfunktion
- Aperiodisk graf
- Cyklisk graf
- Slumpgraf
- Derangemang
- Transposition
- Usage on uk.wikipedia.org
- Usage on vi.wikipedia.org
- Usage on zh.wikipedia.org