arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.3908math.COmath.MG
收藏

Graphicahedron

The Graphicahedron

Gabriela Araujo-Pardo, Maria Del Rio-Francos, Mariana Lopez-Dudet, Deborah Oliveros, Egon Schulte

摘要:

本文描述了由对称群的Cayley图构造抽象多面体的方法。给定任意p个顶点q条边的连通图G,将对称群S_p的一个Cayley图与G联系起来,构造一个秩为q的点传递简单多面体,称之为图多面体,其1-骨架(边图)是Cayley图.图G的图面体是著名的置换面体的推广,置换面体是当图G是路时得到的,本文还讨论了图G的图面体的对称性,并确定了图G小时的图面体的结构。

英文摘要:

The paper describes a construction of abstract polytopes from Cayley graphs of symmetric groups. Given any connected graph G with p vertices and q edges, we associate with G a Cayley graph of the symmetric group S_p and then construct a vertex-transitive simple polytope of rank q, called the graphicahedron, whose 1-skeleton (edge graph) is the Cayley graph. The graphicahedron of a graph G is a generalization of the well-known permutahedron; the latter is obtained when the graph is a path. We also discuss symmetry properties of the graphicahedron and determine its structure when G is small.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑