Directed Graph

A Graph in which each Edge is replaced by a directedEdge, also called a Digraph or Reflexive Graph. A Completedirected graph is called a Tournament. If is an undirected connected Graph, thenone can always direct the circuit Edges of and leave the Separating Edges undirected so that there is a directed path from any node to another. Such a Graph issaid to be transitive if the adjacency relation is transitive. The number of directed graphs of nodes for , 2,... are 1, 3, 16, 218, 9608, ... (Sloane's A000273).

References

Sloane, N. J. A. SequenceA000273/M3032in ``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.

• Sidon Sequence
• Siegel Disk Fractal
• Siegel Modular Function
• Siegel's Paradox
• Siegel's Theorem
• Sierpinski Arrowhead Curve
• Sierpinski Carpet
• Sierpinski Constant
• Sierpinski Curve
• Sierpinski Gasket
• Sierpinski-Menger Sponge
• Sierpinski Number of the First Kind
• Sierpinski Number of the Second Kind
• Sierpinski's Composite Number Theorem
• Sierpinski Sieve
• Sierpinski Sponge
• Sierpinski's Prime Sequence Theorem
• Sierpinski's Theorem
• Sierpinski Tetrahedron
• Sierpinski Triangle
• Sieve
• Sieve of Eratosthenes
• Sievert Integral
• Sievert's Surface
• Sifting Property