Related papers: Graph Powers of Groups II: The RA Matrix

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

The power graph $\Gamma_G$ of a finite group $G$ is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have…

It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…

Let $\mathcal{C}$ be a class of finite groups closed under taking subgroups, quotients, and extensions with abelian kernel. The right-angled Artin pro-$\mathcal{C}$ group $G_\Gamma$ (pro-$\mathcal{C}$ RAAG for short) is the…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

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…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

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…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…

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$…

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…