VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • The graphicahedron
    Araujo-Pardo, Gabriela ...
    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 ▫$\mathcal{G}(G)$▫ of the symmetric group ▫$S_p$▫ and then construct a vertex-transitive simple polytope of rank ▫$q$▫, the graphicahedron, whose 1-skeleton (edge graph) is ▫$\mathcal{G}(G)$▫. 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.
    Vir: European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik. - ISSN 0195-6698 (Vol. 31, iss. 7, 2010, str. 1868-1879)
    Vrsta gradiva - članek, sestavni del
    Leto - 2010
    Jezik - angleški
    COBISS.SI-ID - 16773977

    Povezava(-e):

    http://dx.doi.org/10.1016/j.ejc.2010.03.004

Vnos na polico