Related papers: Affine primitive symmetric graphs of diameter two

Let $G$ be a finite group acting linearly on a vector space $V$. We consider the linear symmetry groups $\operatorname{GL}(Gv)$ of orbits $Gv\subseteq V$, where the \emph{linear symmetry group} $\operatorname{GL}(S)$ of a subset $S\subseteq…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

Let $p$ be a prime. The right-angled Artin pro-$p$ group $G_{\Gamma}$ associated to a fnite simplicial graph $\Gamma$ is the pro-$p$ completion of the right-angled Artin group associated to $\Gamma$. We prove that the following assertions…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

The 2-domination number $\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \gamma_2(G) $ cannot be smaller…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

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…

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,Y^G) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title…

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…

We study the (virtual) indicability of the automorphism group $Aut(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$ associated to a simplicial graph $\Gamma$. First, we identify two conditions -- denoted (B1) and (B2) -- on $\Gamma$…

In this paper, we show that for a graph $\Gamma$ from a class named H-rigid graphs, its subgraph ${\rm Int}(\Gamma)$, named the internal graph of $\Gamma$, is an isomorphism invariant of the graph product of hyperfinite II$_1$-factors…

Let $\Gamma$ be a finite group acting transitively on $[n]=\{1,2,\ldots,n\}$, and let $G=\mathrm{Cay}(\Gamma,T)$ be a Cayley graph of $\Gamma$. The graph $G$ is called normal if $T$ is closed under conjugation. In this paper, we obtain an…

The standard double cover of a graph $\Gamma$ is the direct product $\Gamma\times K_2$. A graph $\Gamma$ is said to be stable if all the automorphisms of $\Gamma\times K_2$ come from its factors. Although the study of stability has…

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…

Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…

Let $q$ be an odd prime power, let $n\ge 2$, and let $V\subsetneq \mathbb F_{q^n}$ be a proper $\mathbb F_q$-vector subspace. Given a nonzero quadratic form $Q(X,Y)\in \mathbb F_{q^n}[X,Y]$, we consider the graph $\Gamma(Q,V)$ that…