Semisymmetric Graphs from Polytopes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edge- but not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
18 pages (to appear in Journal Combinatorial Theory, Series A)

Keywords

Combinatorics, Metric Geometry, 05C25; 51M20

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/113949

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0606469
 http://arxiv.org/abs/math/0606469

Collections

arXiv