Related papers: Every finite group is represented by a finite inci…

For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…

For a finite graph $\Gamma$, let $G(\Gamma)$ be the right-angled Artin group defined by the complement graph of $\Gamma$. We show that, for any linear forest $\Lambda$ and any finite graph $\Gamma$, $G(\Lambda)$ can be embedded into…

Finite symmetries abound in particle physics, from the weak doublets and generation triplets to the baryon octet and many others. These are usually studied by starting from a Lie group, and breaking the symmetry by choosing a particular…

Given a finitely-generated group G, and a finite group \Gamma, Philip Hall defined \delta_\Gamma to be the number of factor groups of G that are isomorphic to \Gamma. We show how to compute the Hall invariants by cohomological and…

Let $G$ be a finite abelian group viewed a $\mathbb{Z}$-module and let $\mathcal{G} = (V, E)$ be a simple graph. In this paper, we consider a graph $\Gamma(G)$ called as a \textit{group-annihilator} graph. The vertices of $\Gamma(G)$ are…

We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

If $G$ is a semisimple Lie group of real rank at least 2 and $\Gamma$ is an irreducible lattice in $G$, then every homomorphism from $\Gamma$ to the outer automorphism group of a finitely generated free group has finite image.

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

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

Given a set $X$, the group $\mathrm{Sym}(X)$ consists of all bijections from $X$ to $X$, and $\mathrm{FSym}(X)$ is the subgroup of maps with finite support i.e. those that move only finitely many points in $X$. We describe the automorphism…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

We study the outer automorphism group of a right-angled Artin group $A_\Gamma$ with finite defining graph $\Gamma$. We construct a subnormal series for $Out(A_\Gamma)$ such that each consecutive quotient is either finite, free-abelian,…

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…

The topological symmetry group $\mathrm{TSG}(\Gamma)$ of an embedding $\Gamma$ of a graph in $S^3$ is the subgroup of the automorphism group of the graph which is induced by homeomorphisms of $(S^3,\Gamma)$. If we restrict to orientation…

Every Hadamard matrix $H$ of order $n > 1$ induces a graph with $4n$ vertices, called the Hadamard graph $\Gamma(H)$ of $H$. Since $\Gamma(H)$ is a distance-regular graph with diameter $4$, it induces a $4$-class association scheme…

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…