ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Research
Biology
Languages
Technology
Mathematics
Literature
Public health
Economy
all records (74)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
USA
Brazil
Ukraine
South Africa
Germany
Australia
Cuba
Pakistan
Italy
all records (79)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
93.066  Articles
1 of 9.308 pages  |  10  records  |  more records»
We develop a new framework for analysing finite connected, oriented graphs of valency four, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of `basic' graphs such that ea... see more

Let G be a permutation group on a set with no fixed points in and let m be a positive integer.If no element of G moves any subset of by more than m points (that is, if |

Let G be a permutation group on a set with no fixed points in and let m be a positive integer. If no element of G moves any subset of by more than m points (that is, if for every and g 2 G), and the lengths two of orbits is p, and the restof orbits have l... see more

Let GG be a finite additive abelian group with exponent n>1n>1, and let a1,…,an-1a_1,\ldots,a_{n-1} be elements of GG. We show that there is a permutation s?Sn-1\sigma\in S_{n-1} such that all the elements sas(s) (s=1,…,n-1)sa_{\sigma(s)}\ (s... see more

Let G be a subgroup of Sn. For x ? G, the index of x in G is denoted by ind x is the minimal number of 2-cycles needed to express x as a product. In this paper, we define a new kind of graph on G, namely the index graph and denoted by Gind(G). Its vertex ... see more

This article discusses the commutation matrix in the Kronecker quaternion group; that is, a non-abelian group whose 32 elements are matrices of 4 × 4 size, with entries in the set of complex numbers. The purpose of this paper is to describe the commutatio... see more

This report is essentially an upgrade of the results of Audu (see [1] and [2]) on some finite permutation groups. It consists of the basic procedure for computing wreath product of groups. We also discussed the conditions under which the wreath products o... see more

s-

Let G be a permutation group on a set withno fixed points in and let m be a positive integer. If for each subset T of the  size |Tg\T| is bounded, for gEG, we define the movement of g as the max|Tg\T| over all subsets T of . In this p... see more

1 of 9.308 pages  |  10  records  |  more records»