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


Semisymmetric cubic graphs as regular covers of K 3,3
Authors:Chang Qun Wang  Tie Sheng Chen
Affiliation:(1) Department of Mathematics, Zhengzhou University, Zhengzhou, 450052, P. R. China
Abstract:A regular graph X is called semisymmetric if it is edge-transitive but not vertex-transitive. For G ≤ AutX, we call a G-cover X semisymmetric if X is semisymmetric, and call a G-cover X one-regular if AutX acts regularly on its arc-set. In this paper, we give the sufficient and necessary conditions for the existence of one-regular or semisymmetric Z n -covers of K 3,3. Also, an infinite family of semisymmetric Z n × Z n -covers of K 3,3 are constructed. Supported in part by NSF of China (Project No. 10571013) and by NSF of He’nan Province of China
Keywords:semisymmetric graph  symmetric graph  covering graph  one-regular graph
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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