ON THE UNRECOGNIZABILITY BY PRIME GRAPH FOR THE ALMOST SIMPLE GROUP PGL(2, 9)
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2016, Vol 36, Issue 2
Abstract
The prime graph of a finite group G is denoted by Γ(G). Also G is called recognizable by prime graph if and only if each finite group H with Γ(H) = Γ(G), is isomorphic to G. In this paper, we classify all finite groups with the same prime graph as PGL(2, 9). In particular, we present some solvable groups with the same prime graph as PGL(2, 9).
Authors and Affiliations
Ali Mahmoudifar
Keywords
Related Articles
- EP ID EP304531
- DOI -
- Views 29
- Downloads 0
ON Γ-SEMIRING WITH IDENTITY
In this paper we study the properties of structures of the semigroup (M, +) and the Γ-semigroup M of Γ-semiring M and regular Γ-semiring M satisfying the identity a + aαb = a or aαb + a = a or a + aαb + b = a or a + 1 =...
CUBIC GENERALIZED BI-IDEALS IN SEMIGROUPS
In this paper, the concept of a cubic generalized bi-ideal in a semigroup is introduced, which is a generalization of the concept of a fuzzy generalized bi-ideal and interval-valued fuzzy generalized bi-ideal. Using this...
Relative determinant of a bilinear module
The aim of the paper is to generalize the (ultra-classical) notion of the determinant of a bilinear form to the class of bilinear forms on projective modules without assuming that the determinant bundle of the module is...
All Maximal Completely Regular Submonoids of HypG(2)
In this paper we consider mappings σ which map the binary operation symbol f to the term σ(f) which do not necessarily preserve the arity. These mapping are called generalized hypersubstitutions of type τ = (2) and we de...
Some finite directly indecomposable non-monogenic entropic quasigroups with quasi-identity
In this paper we show that there exists an infinite family of pairwise non-isomorphic entropic quasigroups with quasi-identity which are directly indecomposable and they are two-generated. Keywords: quasigroups, entropic...