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:
“Thus when I come to shape here at this table between my hands the story of my life and set it before you as a complete thing, I have to recall things gone far, gone deep, sunk into this life or that and become part of it; dreams, too, things surrounding me, and the inmates, those old half-articulate ghosts who keep up their hauntings by day and night ... shadows of people one might have been; unborn selves.”
—Virginia Woolf (1882–1941)
“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)