Complete Graph

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)

    “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)