complete graph
Quick Summary
A complete graph is a type of graph in graph theory where every pair of distinct vertices is connected by a unique edge. In simpler terms, imagine a set of dots (vertices), and every single dot is directly linked to every other dot by a line (edge).12
This means that if you have n vertices, each vertex will have an edge connecting it to the other n-1 vertices. Complete graphs are often denoted as Kn, where n represents the number of vertices. For example, K3 is a triangle, and K4 is a square with its two diagonals.2
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.
combinatoricsCharacterization problems of graph theoryA complete graph Km is a graph with m vertices, any two of which are adjacent. The line graph H of a graph G is a graph the vertices of which correspond to the edges of G, any two vertices of H being adjacent if and…
Read MoreA complete graph Km is a graph with m vertices, any two of which are adjacent. The line graph H of a graph G is a graph the vertices of which correspond to the edges of G, any two vertices of H being adjacent if and…
Read More- number gameGraphs and networks
…the graph is called a complete graph (Figure 13B). A planar graph is one in which the edges have no intersection or common points except at the edges. (It should be noted that the edges of a graph need not be straight lines.) Thus a nonplanar graph can be transformed…
Read More…the graph is called a complete graph (Figure 13B). A planar graph is one in which the edges have no intersection or common points except at the edges. (It should be noted that the edges of a graph need not be straight lines.) Thus a nonplanar graph can be transformed…
Read More
