A **complete graph** is a type of graph in which every pair of distinct vertices is connected by a unique edge. Complete graphs are denoted by the symbol \( K_n \), where \( n \) represents the number of vertices in the graph.
New to topics? Read the docs here!