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
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
- Title not available (Why is that?)
- Abstract Regular Polytopes
- Analysing finite locally 𝑠-arc transitive graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chirality and projective linear groups
- Self-duality of chiral polytopes
- Automorphism groups of symmetric graphs of valency 3
- A census of semisymmetric cubic graphs on up to 768 vertices
- Title not available (Why is that?)
- Medial layer graphs of equivelar 4-polytopes
- On edge but not vertex transitive regular graphs
- A new family of locally 5-arc transitive graphs
- The Gray graph revisited
- The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
- An Edge but not Vertex Transitive Cubic Graph*
- Twisted honeycombs \(\{\) 3,5,3\(\}\) , and their groups
- Tactical Configurations of Rank Two
- On the faithful representation of infinite groups by matrices
- The genus of the Gray graph is 7
- Eisenstein integers and related \(C\)-groups
- An Infinite Graph of Girth 12
- Title not available (Why is that?)
- On Trivalent Graphs Embedded in Twisted Honeycombs
- Some locally 3-arc transitive graphs constructed from triality
Cited In (12)
- Semisymmetric graphs admitting primitive groups of degree \(9p\)
- Semiregular polytopes and amalgamated C-groups
- Symmetric graphs from polytopes of high rank
- Yet another look at the Gray graph
- Semisymmetry of generalized Folkman graphs
- Generating the centrally symmetric 3-polyhedral graphs
- Linking rings structures and semisymmetric graphs: Cayley constructions
- Affine primitive groups and semisymmetric graphs
- Colorful polytopes and graphs
- Cayley graphs and symmetric 4-polytopes
- Semisymmetric graphs of order \(6p ^{2}\) and prime valency
- Medial layer graphs of equivelar 4-polytopes
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)