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
- simple curve
- simple enumeration
- simple extension
- simple fraction
- simple graph
- simple group
- simple harmonic motion
- simple interest
- simple magnet
- Simple Mail Transfer Protocol
- Simple Network Management Protocol
- Simple Object Access Protocol
- simple parity check
- simple pendulum
- simple pole
- simple random sample
- simple root
- simple shear
- simplest form
- simplex
- simplex codes
- simplex communication
- simplex method
- simplex operation
- simplex tableau