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
An ideal-based zero-divisor graph of direct products of commutative rings
In this paper, specifically, we look at the preservation of the diameter and girth of the zero-divisor graph with respect to an ideal of a commutative ring when extending to a finite direct product of commutative rings....
Completely Archimedean Semirings
In this paper we give a structural description of completely Archimedean semirings which is an extension of the structure theorem of completely Archimedean semigroups.
DEVELOPED ZARISKI TOPOLOGY-GRAPH
In this paper, we introduce the developed Zariski topology-graph associated to an R-module M with respect to a subset X of the set of all quasi-prime submodules of M and investigate the relationship between the algebraic...
QUADRATIC APPROXIMATION OF GENERALIZED TRIBONACCI SEQUENCES
In this paper, we give quadratic approximation of generalized Tribonacci sequence {Vn}n≥0 defined by Vn = rVn−1 + sVn−2 + tVn−3 (n ≥ 3) and use this result to give the matrix form of the n-th power of a companion matrix...
On balanced order relations and the normal hull of completely simple semirings
In [1] the authors proved that a semiring S is a completely simple semiring if and only if S is isomorphic to a Rees matrix semiring over a skew-ring R with sandwich matrix P and index sets I and Λ which are bands under...