首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Semisymmetric graphs from polytopes
Authors:Barry Monson  Toma? Pisanski  Egon Schulte  Asia Ivi? Weiss
Institution:a Department of Mathematics and Statistics, University of New Brunswick, Fredericton, NB E3B 5A3, Canada
b University of Ljubljana, FMF Jadranska 19, Ljubljana 1111, Slovenia
c Faculty of Education, University of Primorska, Cankarjeva 5, Koper 6000, Slovenia
d Department of Mathematics, Northeastern University, Boston, MA 02115, USA
e Department of Mathematics and Statistics, York University, Toronto, ON M3J 1P3, Canada
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.
Keywords:Semisymmetric graphs  Abstract regular and chiral polytopes
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号