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 |
- Kozyrev-Grinberg Theory
- k-Partite Graph
- Kramers Rate
- Krawtchouk Polynomial
- Kreisel Conjecture
- Kronecker Decomposition Theorem
- Kronecker Delta
- Kronecker Product
- Kronecker's Polynomial Theorem
- Kronecker Symbol
- Krull Dimension
- Kruskal's Algorithm
- Kruskal's Tree Theorem
- KS Entropy
- k-Statistic
- k-Subset
- k-Theory
- k-Tuple Conjecture
- Kuen Surface
- Kuhn-Tucker Theorem
- Kuiper Statistic
- Kulikowski's Theorem
- Kummer Group
- Kummer's Conjecture
- Kummer's Differential Equation