Graph Convexity and Vertex Orderings
In discrete mathematics, a convex space is an ordered pair (V,M) where M is a family of subsets of a finite set V , such that: ∅ ∈M, V ∈M, andMis closed under intersection. The elements of M are called convex sets. For a set S ⊆ V , the convex hull of S is the smallest convex set that contains S. A...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/5289 |