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 22
- Downloads 0
ON 2-ABSORBING FILTERS OF LATTICES
Let L be a lattice with 1. In this paper we study the concept of 2-absorbing filter which is a generalization of prime filter. A proper filter F of L is called a 2-absorbing filter (resp. a weakly 2-absorbing) if wheneve...
ENUMERATION OF Γ-GROUPS OF FINITE ORDER
The concept of Γ-semigroups is a generalization of semigroups. In this paper, we consider Γ-groups and prove that every Γ-group is derived from a group then, we give the number of Γ-groups of small order.
APPLICATIONS OF SADDLE-POINT DETERMINANTS
For a given square matrix A ∈ Mn(R) and the vector e ∈ (R)^n of ones denote by (A, e) the matrix A e e^T 0 This is often called the saddle point matrix and it plays a significant role in several branches of m...
LEFT ZEROID AND RIGHT ZEROID ELEMENTS OF Γ-SEMIRINGS
In this paper we introduce the notion of a left zeroid and a right zeroid of Γ-semirings. We prove that, a left zeroid of a simple Γ-semiring M is regular if and only if M is a regular Γ-semiring.
Sublattices corresponding to very true operators in commutative basic algebras
We introduce the concept of very true operator on a commutative basic algebra in a way analogous to that for fuzzy logics. We are motivated by the fact that commutative basic algebras form an algebraic axiomatization of...