相关论文: Automorphism groups with cyclic commutator subgrou…

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

In this paper we study the Cayley graph $\mathrm{Cay}(S_n,T)$ of the symmetric group $S_n$ generated by a set of transpositions $T$. We show that for $n\geq 5$ the Cayley graph is normal. As a corollary, we show that its automorphism group…

It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Suppose that a group $G$ acts transitively on the points of a non-Desarguesian plane, $\mathcal{P}$. We prove first that the Sylow 2-subgroups of $G$ are cyclic or generalized quaternion. We also prove that $\mathcal{P}$ must admit an odd…

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \cite{muller,garey} that HAMILTONIAN CYCLE (PATH) are NP-complete in general graphs and chordal…

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

Let $X$ be a compact Riemann surface of genus $g\geq 2$, and let $G$ be a subgroup of $Aut(X)$. We show that if the Sylow $2$-subgroups of $G$ are cyclic, then $|G|\leq 30(g-1)$. If all Sylow subgroups of $G$ are cyclic, then, with two…

The paper describes a construction of abstract polytopes from Cayley graphs of symmetric groups. Given any connected graph G with p vertices and q edges, we associate with G a Cayley graph of the symmetric group S_p and then construct a…

The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about…

Let $G$ be a graph on $n\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced…

In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the…