Semisymmetric graphs from polytopes

From MaRDI portal
Publication:878010

DOI10.1016/J.JCTA.2006.06.007zbMATH Open1117.05051arXivmath/0606469OpenAlexW2028910286WikidataQ56001776 ScholiaQ56001776MaRDI QIDQ878010FDOQ878010


Authors: B. Monson, Tomaž Pisanski, Egon Schulte, Asia Ivić Weiss Edit this on Wikidata


Publication date: 4 May 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0606469




Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Semisymmetric graphs from polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878010)