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:
“Much that is urged on us new parents is useless, because we didn’t really choose it. It was pushed on us. It—whether it be Raffi videos, French lessons, or the complete works of Brazelton—might be just right for you and your particular child. But it is only right when you feel that it is. You know your family best; you decide.”
—Sonia Taitz (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)