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:
“I want relations which are not purely personal, based on purely personal qualities; but relations based upon some unanimous accord in truth or belief, and a harmony of purpose, rather than of personality. I am weary of personality.... Let us be easy and impersonal, not forever fingering over our own souls, and the souls of our acquaintances, but trying to create a new life, a new common life, a new complete tree of life from the roots that are within us.”
—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)