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
- Lexis diagram
- Lexis, Wilhelm (1837–1914)
- Leyden jar
- Leyte Gulf, Battle of (October 1944)
- LF
- LFI
- LFL
- LFO
- l-form
- LGA
- LH
- LHA
- LHB
- LHC
- lherzolite
- LHS
- LHS scheme
- L'Hôpital, Marquis Guillaume François Antoine de
- li
- liabilities
- liability
- Liang–Barsky clipping
- Liao (945–1125)
- Liaqat Ali Khan, Nawabzada (1895–1951)
- Liar paradox