Finite groups whose character degree graphs coincide with their prime graphs

In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character degree graphs are disconnected and coincide with their prime graphs. As a corollary, we find all finite groups whose character degree graphs are square and coincide with their prime graphs.     

Finite groups whose prime graphs do not contain triangles. I

Finite groups whose prime graphs do not contain triangles are investigated. In the present part of the study, the isomorphic types of prime graphs and estimates of the Fitting length of solvable groups are found and almost simple groups are determined.     

OD-characterization of all simple groups whose orders are less than 108

Let M be a simple group whose order is less than 10⁸. In this paper, we prove that if G is a finite group with the same order and degree pattern as M, then the following statements hold: (a) If M ≠ A ₁₀, U ₄(2), then G ≅ M; (b) If M = A ₁₀, then G ≅ A ₁₀ or J ₂ × ℤ₃; (c) If M = U ₄(2), then G is isomorphic to a 2-Frobenius group or U ₄(2). In particular, all simple groups whose orders are less than 10⁸ but A ₁₀ and U ₄(2) are OD-characterizable. As a consequence of this result, we can give a positive answer to a conjecture put forward by W. J. Shi and J. X. Bi in 1990 [Lecture Notes in Mathematics, Vol. 1456, 171–180].      

On recognition of finite simple groups with connected prime graph

The spectrum of a finite group is the set of its element orders. We prove a theorem on the structure of a finite group whose spectrum is equal to the spectrum of a finite nonabelian simple group. The theorem can be applied to solving the problem of recognizability of finite simple groups by spectrum.     

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

A graph is perfectly orderable if and only if it admits an acyclic orientation which does not contain an induced subgraph with verticesa, b, c, d and arcsab, bc, dc. Further a graph is called kernelM-solvable if for every direction of the edges (here pairs of symmetric, i.e. reversible, arcs are allowed) such that every directed triangle possesses at least two pairs of symmetric arcs, there exists a kernel, i.e. an independent setK of vertices such that every other vertex sends some arc towardsK. We prove that perfectly orderable graphs are kernelM-solvable. Using a deep result of Prömel and Steger we derive that almost all perfect graphs are kernelM-solvable.     

Atomic domains in which almost all atoms are prime

ABSTRACT

Let W be a (finite or infinite) Coxeter group and W _X be a proper standard parabolic subgroup of W. We show that the semilattice made up by W equipped with the weak order is a semidirect product of two smaller semilattices associated with W _X .

     

Finite groups whose irreducible Brauer characters have prime power degrees

Let G be a finite group and let p be a prime. In this paper, we classify all finite quasisimple groups in which the degrees of all irreducible p-Brauer characters are prime powers. As an application, for a fixed odd prime p, we classify all finite nonsolvable groups with the above-mentioned property and having no nontrivial normal p-subgroups. Furthermore, for an arbitrary prime p, a complete classification of finite groups in which the degrees of all nonlinear irreducible p-Brauer characters are primes is also obtained.     

Finite groups whose conjugacy class graphs have few vertices

In this note we classify the finite groups satisfying the following property P₅: their conjugacy class lengths are set-wise relatively prime for any 5 distinct classes.Received: 6 October 2004; revised: 16 November 2004     

Finite groups all of whose second maximal subgroups are {\mathcal{H }}_p-groups

Let $G$ be a finite group. A subgroup $H$ of $G$ is called an $\mathcal{H }$ -subgroup of $G$ if $N_G(H)\cap H^g\le H$ for all $g\in G$ . A group $G$ is said to be an ${\mathcal{H }}_p$ -group if every cyclic subgroup of $G$ of prime order or order 4 is an $\mathcal{H }$ -subgroup of $G$ . In this paper, the structure of a finite group all of whose second maximal subgroups are ${\mathcal{H }}_p$ -subgroups has been characterized.     

On groups all of whose noncyclic pd-subgroups are normal

We consider groups in which for some prime p all noncyclic abelian pd-subgroups are normal, assuming that such subgroups exist ( ). We obtain necessary and sufficient conditions for a group to be a . We make connections between the class of and the class of groups in which all noncyclic abelian subgroups are normal and with the class of groups in which all pd-subgroups are normal.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, Nos. 7 and 8, pp. 974–980, July–August, 1991.     

n-极大子群为共轭可换的有限群

群G的子群H称为G的共轭可换子群,若HHg=HgH,对任意g∈G都成立,本文考查了n-极大子群为共轭可换时对有限群构造的影响.