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:
“In the course of the actual attainment of selfish ends—an attainment conditioned in this way by universality—there is formed a system of complete interdependence, wherein the livelihood, happiness, and legal status of one man is interwoven with the livelihood, happiness, and rights of all. On this system, individual happiness, etc. depend, and only in this connected system are they actualized and secured.”
—Georg Wilhelm Friedrich Hegel (1770–1831)
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)