相关论文: Non-Solvable Graph of a Finite Group and Solvabili…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Let $G$ be a finite solvable group. We show that $G$ does not have a normal nonabelian Sylow $p$-subgroup when its prime character degree graph $\Delta(G)$ satisfies a technical hypothesis.

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms, we first prove some results on the solvability of finite groups in which some maximal $A$-invariant subgroups have indices a prime or the square of a…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

We study the finite solvable groups $G$ in which every real element has prime power order. We divide our examination into two parts: the case $\textbf{O}_2(G)>1$ and the case $\textbf{O}_2(G)=1$. Specifically we proved that if…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be $\sigma$-soluble if every chief factor $H/K$ of $G$ is a $\sigma _{i}$-group for some $i=i(H/K)$. A set…

We study the nonabelian composition factors of a finite group $G$ assumed to admit an $\operatorname{Aut}(G)$-orbit of length at least $\rho|G|$, for a given $\rho\in\left(0,1\right]$. Our main results are the following: The orders of the…

For every non-nilpotent finite group $G$, there exists at least one proper subgroup $M$ such that $G$ is the setwise product of a finite number of conjugates of $M$. We define $\gamma_{\text{cp}}\left( G\right) $ to be the smallest number…

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is a graph whose vertex set is the group $G$ and distinct elements $x,y\in G$ are adjacent if one is a power of the other, that is, $x$ and $y$ are adjacent if $x\in\langle y\rangle$ or…

Let G be a finite group. Denote by \psi(G) the sum \psi(G)=\sum_{x\in G}|x| where |x| denotes the order of the element x, and by o(G) the quotient o(G)=\frac{\psi(G)}{|G|}. Confirming a conjecture posed by E.I. Khukhro, A. Moreto and M.…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

Let $G$ be a finite group and $\sigma$ a partition of the set of all? primes $\Bbb{P}$, that is, $\sigma =\{\sigma_i \mid i\in I \}$, where $\Bbb{P}=\bigcup_{i\in I} \sigma_i$ and $\sigma_i\cap \sigma_j= \emptyset $ for all $i\ne j$. If $n$…

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022)). They give a classification for nilpotent groups and…

Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…

A graph $G = (V, E)$ is \emph{partitionable} if there exists a partition $\{A, B\}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph. In this paper we investigate the computational complexity of…