Related papers: Normal subgroups whose conjugacy class graph has d…

We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k=\theta_0>\theta_1>... >\theta_d$. We show the intersection numbers $a_1, b_1$ satisfy $$ (\theta_1 + {k \over a_1+1}) (\theta_d + {k \over a_1+1}) \ge -…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers…

A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

A group $G$ is said to have dense normalizers if each non-empty open interval in its subgroup lattice $L(G)$ contains the normalizer of a certain subgroup of $G$. In this note, we find all finite groups satisfying this property. We also…

Let $G$ be the alternating group $\mbox{Alt}(n)$ on $n$ letters. We prove that for any $\varepsilon > 0$ there exists $N = N(\varepsilon) \in \mathbb{N}$ such that whenever $n \geq N$ and $A$, $B$, $C$, $D$ are normal subsets of $G$ each of…

The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of…

A group is nested if the centers of the irreducible characters form a chain. In this paper, we will show that there is a set of subgroups associated with the conjugacy classes of group so that a group is nested if and only if these…

Let G be a group and H be a subgroup of G which is either finite or of finite index in G. In this note, we give some characterizations for normality of H in G. As a consequence we get a very short and elementary proof of the Main Theorem of…

Let ${\cal C}$ be a nonempty class of finite groups closed under taking subgroups, homomorphic images and extensions. A subgroup $H$ of an abstract residually ${\cal C}$ group $R$ is said to be conjugacy ${\cal C}$-distinguished if whenever…

For a division ring D, finite dimensional over its center F, we give a condiction for the connectedness of the commuting graph of a matrix ring over $D$. Furthermore, we prove that if the commuting graph is connected, then its diameter is…

A subgroup $H$ of a finite group $G$ is said to be an $\mathscr{H}C$-subgroup of $G$ if there exists a normal subgroup $T$ of $G$ such that $G=HT$ and $H^g \cap N_T(H)\leq H$ for all $g\in G$. In this paper, we investigate the structure of…

Let $\mathcal{T}$ be the set of spanning trees of $G$ and let $L(T)$ be the number of leaves in a tree $T$. The leaf number $L(G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathcal{T}\}$. Let $G$ be a connected graph of order $n$ and…