Semisymmetric Graphs from Polytopes

Simple item page
dc.creatorMonson, Barry
dc.creatorPisanski, Tomaz
dc.creatorSchulte, Egon
dc.creatorWeiss, Asia Ivic
dc.date2006-06-19
dc.date.accessioned2026-07-07T07:17:28Z
dc.date.available2026-07-07T07:17:28Z
dc.descriptionEvery 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.
dc.description18 pages (to appear in Journal Combinatorial Theory, Series A)
dc.identifierhttps://arxiv.org/abs/math/0606469
dc.identifierhttp://arxiv.org/abs/math/0606469
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113949
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject05C25; 51M20
dc.titleSemisymmetric Graphs from Polytopes
dc.typetext

Files

Collections

arXiv