Euler Graph
A Graph containing an Eulerian Circuit. An undirected Graph is Eulerian Iff every Vertex has Even Degree. A Directed Graph isEulerian Iff every Vertex has equal Indegree and Outdegree. A planarBipartite Graph is Dual to a planar Euler graph and vice versa. The number of Euler graphs with
nodes are 1, 1, 2, 3, 7, 16, 54, 243, ... (Sloane's A002854).
References
Sloane, N. J. A. SequenceA002854/M0846in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.
- Runge-Walsh Theorem
- Running Knot
- Russell's Antinomy
- Russell's Paradox
- Russian Multiplication
- Russian Roulette
- Ryser Formula
- Rényi's Parking Constants
- Rössler Model
- Saalschützian
- Saalschütz's Theorem
- s-Additive Sequence
- Saddle
- Saddle-Node Bifurcation
- Saddle Point (Fixed Point)
- Saddle Point (Function)
- Saddle Point (Game)
- Safarevich Conjecture
- Safe
- Sagitta
- Saint Andrew's Cross
- Saint Anthony's Cross
- Saint Petersburg Paradox
- Sal
- Salamin Formula