Complete Bipartite Graph
A Bipartite Graph (i.e., a set of Vertices decomposed into two disjoint sets such thatthere are no two Vertices within the same set are adjacent) such that every pair ofVertices in the two sets are adjacent. If there are 
and 
Vertices in the two sets, the complete bipartite graph (sometimes also called a Complete Bigraph) is denoted
. The above figures show 
and 
.
References
Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 12, 1986.
- Shadow
- Shadowing Theorem
- Shafarevich Conjecture
- Shah Function
- Shah-Wilson Constant
- Shallit Constant
- Shallow Diagonal
- Shanks' Algorithm
- Shanks' Conjecture
- Shannon Entropy
- Shannon Sampling Theorem
- Shape Operator
- Shapiro's Cyclic Sum Constant
- Sharing Problem
- Sharkovsky's Theorem
- Sharpe Ratio
- Sharpe's Differential Equation
- Sheaf (Geometry)
- Sheaf (Topology)
- Shear
- Shear Matrix
- Shephard's Problem
- Sheppard's Correction
- Sherman-Morrison Formula
- Shi