A complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. It is characterized by having the maximum possible number of edges for a given number of vertices, making it a fundamental structure in graph theory for studying connectivity and network topology.