Related papers: Several Quantitative Characterizations of Some Spe…

In this paper, we show that every highly edge-connected graph $G$, under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$ with $1\le i\le k$,…

Suppose G is a finite group, and K is a normal solvable subgroup of G. In this paper, we present a powerful method which is called K-Exit. Using this method, we find some members of {\pi}(G) that are not members of {\pi}(K) and for this…

Let $G$ be a finite solvable group, let $Irr(G)$ be the set of all complex irreducible characters of $G$ and let $cd(G)$ be the set of all degrees of characters in $Irr(G).$ Let $\rho(G)$ be the set of primes that divide degrees in $cd(G).$…

The power graph $\mathcal{P}(G)$ of a group $G$ is the simple graph with vertex set $G$ and two vertices are adjacent whenever one of them is a positive power of the other. In this paper, for a finite noncyclic nilpotent group $G$, we study…

A $c$-labeling $\phi: V(G) \rightarrow \{1, 2, \hdots, c \}$ of graph $G$ is distinguishing if, for every non-trivial automorphism $\pi$ of $G$, there is some vertex $v$ so that $\phi(v) \neq \phi(\pi(v))$. The distinguishing number of $G$,…

A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D(G)$, is the smallest number of colors required for such a…

A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus D$ is adjacent to a vertex in $D$. The cardinality of a smallest dominating set of $D$ is called the domination number of $G$ and is denoted…

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…

If G is a non-nilpotent group and nil(G) = {g \in G : <g, h> is nilpotent for all h\in G}, the nilpotent graph of G is the graph with set of vertices G-nil(G) in which two distinct vertices are related if they generate a nilpotent subgroup…

A graph $G$ is said to be $d$-distinguishable if there is a labeling of the vertices with $d$ labels so that only the trivial automorphism preserves the labels. The smallest such $d$ is the distinguishing number, Dist($G$). A subset of…

We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs. Of the 853…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if there is an element of order $pq$ in $G$. Prime graphs of solvable groups have…

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides…

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

The Pr\"ufer rank $\mathrm{rk}(G)$ of a profinite group $G$ is the supremum, across all open subgroups $H$ of $G$, of the minimal number of generators $\mathrm{d}(H)$. It is known that, for any given prime $p$, a profinite group $G$ admits…

Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented. Interestingly enough all those problems so far are…

Let $ G$ be a finite group and $p$ be a prime. Let $ \mathrm{Vo}(G) $ denote the set of the orders of vanishing elements, $\mathrm{Vo}_{p} (G)$ be the subset of $ \mathrm{Vo}(G) $ consisting of those orders of vanishing elements divisible…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \mathscr L $-$ \Pi $-property in $ G $ if $ H\unlhd G $, or if $ | G / K : \mathrm{N} _{G / K} (HK/K)| $ is a $ \pi (HK/K) $-number for any $ G…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

Let $p$ be a prime and $\mathbb{F}_p$ be a finite field of $p$ elements. Let $\mathbb{F}_pG$ denote the group algebra of the finite $p$-group $G$ over the field $\mathbb{F}_p$ and $V(\mathbb{F}_pG)$ denote the group of normalized units in…