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