A simple graph in which every vertex is joined to every other by a single edge. The complete graph with n vertices, denoted by Kn, is regular of degree n-1 and has edges. See also bipartite graph.
A graph G in which there is an edge joining every pair of distinct vertices; every vertex is adjacent to every other vertex. If G contains n vertices then the number of edges is
- Huygens
- Huygens atmospheric structure instrument
- Huygens, Christiaan
- Huygens, Christiaan (1629–95)
- Huygens Gap
- Huygens probe
- Huygens’ construction
- Huygens’ principle
- Huynh–Feldt correction
- HVAC
- H wave
- HWHM
- HX
- HY-1B
- hyacinth
- Hyades
- Hyaenidae
- Hyakutake
- Hyakutake, Comet
- hyaline
- hyaline cartilage
- hyaloclastite
- hyalopilitic
- hyaloplasm
- Hyalospongea