Related papers: Square character degree graphs yield direct produc…

A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{\theta}{\theta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {\Gamma}(G) (or GK(G)) and its…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

We give closed product formulas for the irreducible characters of the symmetric groups related to rectangular `almost square' Young diagrams $p \times(p+\delta)$ for a fixed value of an integer $\delta$ and an arbitrary integer $p$.

The prime graph of a finite group $G$ is denoted by $\ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $\ga(H)=\ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with…

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

Let $G$ be a finite group and let $\rm{Irr}(G)$ be the set of all irreducible complex characters of $G$. For a character $\chi \in \rm{Irr}(G)$, the number $\rm{cod}(\chi):=|G:\rm{ker}\chi|/\chi(1)$ is called the co-degree of $\chi$. The…

In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored…

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…

The general position number ${\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\rm gp}(G)\ge…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

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.