Difference between revisions of "Flip graph"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In the mathematical field of graph theory, a '''flip graph''' is a graph whose vertices are combinatorial or geometric obj...") |
(No difference)
|
Latest revision as of 11:41, 24 August 2016
In the mathematical field of graph theory, a flip graph is a graph whose vertices are combinatorial or geometric objects, and whose edges link two of these objects when they can be obtained from one another by an elementary operation called a flip.
Description
Flip graphs are special cases of geometric graphs.
Among noticeable flip graphs, one finds the 1-skeleton of polytopes such as associahedra or cyclohedra.
See also
- Associahedra - an (n − 2)-dimensional convex polytope in which each vertex corresponds to a way of correctly inserting opening and closing parentheses in a word of n letters and the edges correspond to single application of the associativity rule.
- Graph (discrete mathematics)
- Graph theory
External links
- Flip graph @ Wikipedia
