Encyclopedia of Combinatorial Polytope Sequences
Back to big table.
Graph multiplihedron (edgeless graph)
(2, 6, 0, 3)
• Edgeless-graph-multiplihedra JG
[arxiv] (Devadoss, Forcey)
• Dimensions:
0, 1, 2, 3, ... n
• Number of Vertices in nth polytope:
1, 2, 6, 15, 36, ... n*2^(n-1) + n [ OEIS A215149]
• Number of Facets:
0, 2, 6, 11, 20, ... 2^n + n [ OEIS ?]
top    index