Page 1

Displaying 1 – 3 of 3

Showing per page

Hexavalent ( G , s ) -transitive graphs

Song-Tao Guo, Xiao-Hui Hua, Yan-Tao Li (2013)

Czechoslovak Mathematical Journal

Let X be a finite simple undirected graph with a subgroup G of the full automorphism group Aut ( X ) . Then X is said to be ( G , s ) -transitive for a positive integer s , if G is transitive on s -arcs but not on ( s + 1 ) -arcs, and s -transitive if it is ( Aut ( X ) , s ) -transitive. Let G v be a stabilizer of a vertex v V ( X ) in G . Up to now, the structures of vertex stabilizers G v of cubic, tetravalent or pentavalent ( G , s ) -transitive graphs are known. Thus, in this paper, we give the structure of the vertex stabilizers G v of connected hexavalent ( G , s ) -transitive...

Highly transitive subgroups of the symmetric group on the natural numbers

U. B. Darji, J. D. Mitchell (2008)

Colloquium Mathematicae

Highly transitive subgroups of the symmetric group on the natural numbers are studied using combinatorics and the Baire category method. In particular, elementary combinatorial arguments are used to prove that given any nonidentity permutation α on ℕ there is another permutation β on ℕ such that the subgroup generated by α and β is highly transitive. The Baire category method is used to prove that for certain types of permutation α there are many such possibilities for β. As a simple corollary,...

Currently displaying 1 – 3 of 3

Page 1