Search results
We did not find results for: define complete graph.
Check spelling or type a new query.
We did not find results for: define complete graph.
Check spelling or type a new query.
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Wikipedia