Title of article :
Primitive half-transitive graphs constructed from the symmetric groups of prime degrees
Author/Authors :
Lu، نويسنده , , Zai Ping، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Pages :
9
From page :
818
To page :
826
Abstract :
A graph is said to be half-transitive if its automorphism group acts transitively on the vertex set and edge set but intransitively on the arc set. In this paper, we construct infinitely many primitive half-transitive graphs with automorphism groups being the symmetric groups of prime degrees, and show that there exists at least one primitive half-transitive graph of valency 2p for a prime p no less than 7 and p ≠ 13 . As a byproduct of our construction, infinitely many primitive 2-arc-regular Cayley graphs are given.
Keywords :
Primitive permutation group , Symmetric graph , Half-transitive graph , Suborbit
Journal title :
Journal of Combinatorial Theory Series B
Serial Year :
2007
Journal title :
Journal of Combinatorial Theory Series B
Record number :
1527864
Link To Document :
بازگشت