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:
“Fate forces its way to the powerful and violent. With subservient obedience it will assume for years dependency on one individual: Caesar, Alexander, Napoleon, because it loves the elemental human being who grows to resemble it, the intangible element. Sometimes, and these are the most astonishing moments in world history, the thread of fate falls into the hands of a complete nobody but only for a twitching minute.”
—Stefan Zweig (18811942)
“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)