相关论文: Orbital graphs of infinite primitive permutation g…

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a $G$-vertex-transitive graph $\Gamma$. In the main result the group $G$ is quasiprimitive or biquasiprimitive on the vertices of $\Gamma$, and we…

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ synchronizes $f$ if the semigroup $\langle G,f\rangle$ contains a constant map. The…

Let \pi(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set \pi(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer in $G$ is trivial. By $b(G)$ we denote the size of the smallest base of $G$. Every permutation group with $b(G)=2$ contains…

A set $S$ of vertices of a graph $G$ is \emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \emph{locating-dominating set} of $G$ is a dominating distinguishing set. The…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…

For a non-complete graph $\Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $u\neq w$ and $u,w$ are not adjacent. Then $\Gamma$ is said to be $2$-geodesic transitive if its automorphism…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Let $\gamma(G)$ and $\beta(G)$ denote the domination number and the covering number of a graph $G$, respectively. A connected non-trivial graph $G$ is said to be $\gamma\beta$-{perfect} if $\gamma(H)=\beta(H)$ for every non-trivial induced…

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

We prove that if $G\subset\text{Diff}^{1}(\mathbb{R}^2)$ is an Abelian subgroup generated by a family of commuting diffeomorphisms of the plane, all of which are $C^{1}$-close to the identity in the strong $C^{1}$-topology, and if there…

Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…

Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let \rho(G) be the set of all primes which divide some character degree of G. The prime graph \Delta(G) attached to G is a graph whose vertex…

The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set…

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…