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).
A drawing of a complete graph, with its vertices placed on a regular polygon, is sometimes referred to as a mystic rose.
Read more about Complete Graph: Properties, Geometry and Topology, Examples
Famous quotes containing the words complete and/or graph:
“No man, said Birkin, cuts another man’s throat unless he wants to cut it, and unless the other man wants it cutting. This is a complete truth. It takes two people to make a murder: a murderer and a murderee.... And a man who is murderable is a man who has in a profound if hidden lust desires to be murdered.”
—D.H. (David Herbert)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)