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:
“Although my parents have never been the kind to hint around about grandchildren, I can think of no better tribute to them than giving them some.... I can’t help thinking that the cycle is not complete until I can introduce them to a child of their child. And I can think of no better comfort when they are gone than to know that something of them lives on, not only in me but in my children.”
—Anne Cassidy. “Every Child Should Have a Father But....,” McCall’s (March 1985)
“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)