In graph theory, a bound graph expresses which pairs of elements of some partially ordered set have an upper bound. Rigorously, any graph G is a bound graph if there exists a partial order ≤ on the vertices of G with the property that for any vertices u and v of G, uv is an edge of G if and only if u ≠ v and there is a vertex w such that u ≤ w and v ≤ w.
Bound graphs are sometimes referred to as upper bound graphs, but the analogously defined lower bound graphs comprise exactly the same class—any lower bound for ≤ is easily seen to be an upper bound for the dual partial order ≥.
Famous quotes containing the words bound and/or graph:
“Edith: This complete loveliness will fade. And we shall forget what it was like.
Edward: Edith, don’t.
Edith: Oh, it’s bound to. Just a few years and the gilt wears off the gingerbread.
Edward: Darling, answer me one thing truthfully. Have you ever seen gingerbread with gilt on it?
Edith: [laughing] Fool!
Edward: Then the whole argument is disposed of.”
—Reginald Berkeley (1890 N1935)
“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)