A classification of semisymmetric graphs of order 2pq

被引：110

作者：

Du, SF ^{[1
]}

Xu, MY

机构：

[1] Capital Normal Univ, Dept Math, Beijing 100037, Peoples R China

[2] Peking Univ, Dept Math, Beijing 100871, Peoples R China

来源：

COMMUNICATIONS IN ALGEBRA | 2000年 / 28卷 / 06期

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1080/00927870008826987

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper gives a classification of semisymmetric graphs of order 2pq where p and q are distinct primes. It is shown that there are 143 examples of such graphs, 131 of which are biprimitive.

引用

页码：2685 / 2715

页数：31

共 24 条

[1] AN EDGE BUT NOT VERTEX TRANSITIVE CUBIC GRAPH [J].

BOUWER, IZ .

CANADIAN MATHEMATICAL BULLETIN, 1968, 11 (04) :533-&

[2]

BOUZER IZ, 1972, J COMB THEORY B, V12, P32

[3] FINITE PERMUTATION-GROUPS AND FINITE SIMPLE-GROUPS [J].

CAMERON, PJ .

BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1981, 13 (JAN) :1-22

[4]

CHENG Y, 1987, J COMB THEORY B, V4, P196

[5]

CONWAY JH, 1985, ATLAS FINTIE GROUPS

[6]

Dickson LE., 1958, LINEAR GROUPS EXPOSI

[7]

Dixon JD., 1996, PERMUTATION GROUPS

[8]

Du S. F., 1995, GRAPH THEORY NOTES N, VXXIX

[9] Biprimitive graphs of smallest order [J].

Du, SF ;

Marusic, D .

JOURNAL OF ALGEBRAIC COMBINATORICS, 1999, 9 (02) :151-156

[10]

Folkman J., 1967, J. Combinatorial Theory, V3, P215, DOI 10.1016/S0021-9800(67)80069-3

← 1 2 3 →