Related papers: Square character degree graphs yield direct produc…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…

Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if…

We show that if the degree sequence of a graph $G$ is close in $\ell_1$-distance to a given realizable degree sequence $(d_1,\dots,d_n)$, then $G$ is close in edit distance to a graph with degree sequence $(d_1,\dots,d_n)$. We then use this…

Let $G$ be a restricted direct product of finite groups $\{G_i \}_{i\in I}$, and let $\Zl^1(G)$ denote the centre of its group algebra. We show that $\Zl^1(G)$ is amenable if and only if $G_i$ is abelian for all but finitely many $i$, and…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

Let B be a block of a finite group G with defect group D. We prove that the exponent of the center of D is determined by the character table of G. In particular, we show that D is cyclic if and only if B contains a "large" family of…

Let $\Gamma$ be a finite graph together with a group $G_v$ at each vertex $v$. The graph product $G(\Gamma)$ is obtained from the free product of all $G_v$ by factoring out by the normal subgroup generated by $\{g^{-1}h^{-1}gh; g\in G_v,…

We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Let $(\mathcal{A}, G, \alpha)$ be a groupoid dynamical system. We show that if $G$ is assumed to be measurewise amenable and the section algebra $A = \Gamma_0(G^{(0)}, \mathcal{A})$ is nuclear, then the associated groupoid crossed product…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of irreducible characters of $G$. The codegree of an irreducible character $\chi$ of the group $G$ is defined as $\mathrm{cod}(\chi)=|G:\mathrm{ker}(\chi)|/\chi(1)$. In this paper,…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

Let $G$ be a finite group and ${\rm cd}(G)$ denote the set of complex irreducible character degrees of $G$. In this paper, we prove that if $G$ is a finite group and $H$ is an almost simple group with socle $H_{0}= \, ^{2}{\rm G}_{2}(q)$,…

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…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…