Completely Regular Graph
A Polyhedral Graph is completely regular if the Dual Graph is also Regular. There areonly five types. Let 
be the number of Edges at each node, 
the number ofEdges at each node of the Dual Graph, 
the number of Vertices,
the number of Edges, and 
the number of faces in the Platonic Solid corresponding tothe given graph. The following table summarizes the completely regular graphs.
| Type | | | | | |
| Tetrahedral | 3 | 3 | 4 | 6 | 4 |
| Cubical | 3 | 4 | 8 | 12 | 6 |
| Dodecahedral | 3 | 5 | 20 | 39 | 12 |
| Octahedral | 4 | 3 | 6 | 12 | 8 |
| Icosahedral | 5 | 3 | 12 | 30 | 20 |
- Kummer's Series Transformation
- Kummer's Test
- Kummer's Theorem
- Kummer Surface
- Kuratowski Reduction Theorem
- Kuratowski's Closure-Component Problem
- Kuratowski's Theorem
- Kurtosis
- Kähler Manifold
- König-Egeváry Theorem
- Königsberg Bridge Problem
- König's Theorem
- Kürschák's Tile
- L1-Norm
- L2-Norm
- L2-Space
- Labeled Graph
- Lacunarity
- Ladder
- Ladder Graph
- Lagrange Bracket
- Lagrange-Bürmann Theorem
- Lagrange Expansion
- Lagrange Interpolating Polynomial
- Lagrange Inversion Theorem