...
首页> 外文期刊>European journal of combinatorics >Semisymmetric graphs of order 2p~3
【24h】

Semisymmetric graphs of order 2p~3

机译:2p〜3阶的半对称图

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in Folkman (1967) [14] that there exist no semisymmetric graphs of order 2p and 2p~2, where p is a prime. The classification of semisymmetric graphs of order 2pq was given in Du and Xu (2000) [12], for any distinct primes p and q. Our long term goal is to determine all the semisymmetric graphs of order 2p~3, for any prime p. All these graphs Γ are divided into two subclasses: (I) Aut(Γ) acts unfaithfully on at least one bipart; and (II) Aut(Γ) acts faithfully on both biparts. This paper gives a group theoretical characterization for Subclass (I) and based on this characterization, we shall give a complete classification for this subclass in our further research.
机译:如果简单的无向图是规则的且具有边沿传递性但不具有顶点传递性,则称其为半对称的。每个半对称图都是具有相等大小的两个部分的二部图。在Folkman(1967)[14]中证明,不存在2p和2p〜2阶的半对称图,其中p是素数。对于Du和Xu(2000)[12],对于任何不同的素数p和q,给出了2pq阶半对称图的分类。我们的长期目标是确定任何素数p的所有2p〜3阶半对称图。所有这些图Γ分为两个子类:(I)Aut(Γ)忠实地作用于至少一个二等分; (II)Aut(Γ)忠实地对待两个两部分。本文给出了子类(I)的组理论特征,并在此特征的基础上,我们将在进一步研究中对该子类进行完整的分类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号