Geodesic
A class of semisymmetric graphs
Ars Mathematica Contemporanea, Tome 7 (2014) no. 1, pp. 40-53.

Voir la notice de l'article provenant de la source Ars Mathematica Contemporanea website

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. Let p be a prime. In this paper, a class of semisymmetric graphs of order 2p3 are determined. This work is a partial result for our long term goal to classify all semisymmetric graphs of order 2p3.
DOI : 10.26493/1855-3974.276.9a5
Keywords: Permutation group, primitive group, vertex-transitive graph, semisymmetric graph 
@article{10_26493_1855_3974_276_9a5,
     author = {Li Wang and Shaofei Du and Xuewen Li},
     title = {A class of semisymmetric graphs},
     journal = {Ars Mathematica Contemporanea},
     pages = {40--53},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {2014},
     doi = {10.26493/1855-3974.276.9a5},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.276.9a5/}
}
TY  - JOUR
AU  - Li Wang
AU  - Shaofei Du
AU  - Xuewen Li
TI  - A class of semisymmetric graphs
JO  - Ars Mathematica Contemporanea
PY  - 2014
SP  - 40
EP  - 53
VL  - 7
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.276.9a5/
DO  - 10.26493/1855-3974.276.9a5
LA  - en
ID  - 10_26493_1855_3974_276_9a5
ER  - 
%0 Journal Article
%A Li Wang
%A Shaofei Du
%A Xuewen Li
%T A class of semisymmetric graphs
%J Ars Mathematica Contemporanea
%D 2014
%P 40-53
%V 7
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.276.9a5/
%R 10.26493/1855-3974.276.9a5
%G en
%F 10_26493_1855_3974_276_9a5
Li Wang; Shaofei Du; Xuewen Li. A class of semisymmetric graphs. Ars Mathematica Contemporanea, Tome 7 (2014) no. 1, pp. 40-53. doi : 10.26493/1855-3974.276.9a5. http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.276.9a5/

Cité par Sources :