相关论文: Generalized quaternion groups with the m-DCI prope…

A semitopological group $G$ is called {\it an $n$-semitopological group}, if for any $g\in G$ with $e\not\in\overline{\{g\}}$ there is a neighborhood $W$ of $e$ such that $g\not\in W^{n}$, where $n\in\mathbb{N}$. The class of…

We show that a quotient group of a CI-group with respect to (di)graphs is a CI-group with respect to (di)graphs.

The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge,…

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…

In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the…

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four…

A finite group of order divisible by 3 in which centralizers of 3-elements are 3-subgroups will be called a C{\theta}{\theta}-group. The prime graph (or Gruenberg-Kegel graph) of a finite group G is denoted by {\Gamma}(G) (or GK(G)) and its…

A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…

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…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if if there exists a chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that for…

Let $G$ be a group and let $S$ be a generating set of $G$. In this article, we introduce a metric $d_C$ on $G$ with respect to $S$, called the cardinal metric. We then compare geometric structures of $(G, d_C)$ and $(G, d_W)$, where $d_W$…

For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…

The fundamental group of a closed irreducible 3-dimensional manifold has the Rapid Decay property if and only if it is not virtually Sol. This is proved by studying distortion of length functions in graphs of groups, and the stability of…

In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where…

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of…

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…