Title of article
Note on Infinite Families of Trivalent Semisymmetric Graphs
Author/Authors
Lipschutz، نويسنده , , Seymour and Xu، نويسنده , , Ming-Yao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
707
To page
711
Abstract
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL (2, p) and PGL (2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.
Journal title
European Journal of Combinatorics
Serial Year
2002
Journal title
European Journal of Combinatorics
Record number
1549410
Link To Document