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:
“To throw obstacles in the way of a complete education is like putting out the eyes; to deny the rights of property is like cutting off the hands. To refuse political equality is like robbing the ostracized of all self-respect, of credit in the market place, of recompense in the world of work, of a voice in choosing those who make and administer the law, a choice in the jury before whom they are tried, and in the judge who decides their punishment.”
—Elizabeth Cady Stanton (1815–1902)
“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)