User:Nonenmac/graphs
Jump to navigation
Jump to search
Newer graphs (uncategorized as of yet)[edit]
 Desargues graph |
 Pappus graph |
 Foster graph |
 Shrikhande graph |
 Heawood graph |
Fullerene graphs[edit]
In graph theory, a fullerene graph is a cubic 3-connected planar graph with exactly 12 pentagonal faces and an optional number of hexagonal faces. Fullerene graphs are the Schlegel representations of the corresponding fullerene compounds.
 20-fullerene (dodecahedral graph) |
 24-fullerene |
 26-fullerene |
 60-fullerene (truncated icosahedral graph) |
 70-fullerene |
Tower of Hanoi[edit]
Tower of Hanoi (1-disk) All Paths[edit]
Tower of Hanoi (2-disk) All Paths[edit]
Tower of Hanoi (3-disk) All Paths[edit]
Tower of Hanoi (3-disk) Longest Path[edit]
Pascal's triangle[edit]
Pascal's Triangle with various numbers shaded[edit]
|
|
| Pascal's triangle with odd numbers shaded | Pascal's triangle with numbers not divisible by 3 shaded |
|
|
| Pascal's triangle with numbers not divisible by 4 shaded | Pascal's triangle with numbers not divisible by 5 shaded |
Pascal's triangle graph showing the 4 paths to the number 4[edit]
Knight's graph[edit]
|
|
| Complete graph showing number of possible moves from each position | An Euler solution to the knight's tour poblem |
Knot graphs, just nots[edit]
Connected Dynkin Diagrams[edit]
Euler Method[edit]
