Related papers: Commuting graph of $A$-orbits

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

Suppose that $\Gamma=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…

Let $\Gamma$ be a finite d-valent graph and G an n-dimensional torus. An ``action'' of G on $\Gamma$ is defined by a map, $\alpha$, which assigns to each oriented edge e of $\Gamma$ a one-dimensional representation of G (or, alternatively,…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

We consider the orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Gamma)$, where $\Gamma$ is a connected graph of genus $g>1$, embedded in $S^3$. For each $g$ we give the maximum order $m_g$ of such $G$ acting on $(S^3,…

Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph ${\Gamma}(G)$, whose vertex set is $G\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that ${\Gamma}(G)$ is strong $k$ star free if…

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

Let $X$ be a compact metrizable group and $\Gamma$ a countable group acting on $X$ by continuous group automorphisms. We give sufficient conditions under which the dynamical system $(X,\Gamma)$ is surjunctive, i.e., every injective…

We study finite transitive permutation groups $G\leqslant\operatorname{Sym}(\Omega)$ such that all orbits of the conjugation action on $G$ of the normaliser of $G$ in $\operatorname{Sym}(\Omega)$ have size bounded by some constant. Our…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…

We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.

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…