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:
“The complete life, the perfect pattern, includes old age as well as youth and maturity. The beauty of the morning and the radiance of noon are good, but it would be a very silly person who drew the curtains and turned on the light in order to shut out the tranquillity of the evening. Old age has its pleasures, which, though different, are not less than the pleasures of youth.”
—W. Somerset Maugham (1874–1965)
“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)