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:
“‘Tis chastity, my brother, chastity.
She that has that is clad in complete steel,
And like a quivered nymph with arrows keen
May trace huge forests and unharbored heaths,
Infamous hills and sandy perilous wilds,
Where, through the sacred rays of chastity,
No savage fierce, bandit, or mountaineer
Will dare to soil her virgin purity.”
—John Milton (1608–1674)
“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)