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
- missing market
- missing mass
- missing observations
- missing values
- mission
- mission control centre
- mission control team
- Mission Demonstration Test Satellite
- Mission Design Section
- mission elapsed time
- mission operations and data analysis
- mission specialist
- mission station
- mission status report
- Mississippian
- Mississippi cultures
- Missourian
- Missouri Compromise (1820–21)
- misspecified model
- mist
- mist flow
- mistletoe
- mistral
- misuse failure
- MIT