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:
“What I expect from my male friends is that they are polite and clean. What I expect from my female friends is unconditional love, the ability to finish my sentences for me when I am sobbing, a complete and total willingness to pour their hearts out to me, and the ability to tell me why the meat thermometer isn’t supposed to touch the bone.”
—Anna Quindlen (20th century)
“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)