In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices ui and vi and with an edge from ui to vj whenever i ≠ j. The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, or as a bipartite Kneser graph Hn,1 representing the 1-item and (n − 1)-item subsets of an n-item set, with an edge between two subsets whenever one is contained in the other.
Read more about Crown Graph: Examples, Properties, Applications
Famous quotes containing the words crown and/or graph:
“Or shatter too with him my curious frame:
And let these wither, so that he may die,
Though set with Skill and chosen out with Care.
That they, while Thou on both their Spoils dost tread,
May crown thy Feet, that could not crown thy Head.”
—Andrew Marvell (1621–1678)
“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)