相关论文: The $k$-orbit theory and polycirculant conjecture

The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Given two subgroups $H,K$ of a finite group $G$, the probability that a pair of random elements from $H$ and $K$ commutes is denoted by $Pr(H,K)$. Suppose that a finite group $G$ admits a group of coprime automorphisms $A$ and let…

We present a decomposition of rational twisted $G$-equivariant K-theory, $G$ a finite group, into cyclic group equivariant K-theory groups of fixed point spaces. This generalises the untwisted decomposition by Atiyah and Segal as well as…

Let $G\subset GL_n(k)$ be a finite subgroup and $k[x_1,\dots, x_n]^G\subset k[x_1,\dots, x_n]$ its ring of invariants. We show that, in many cases, the automorphism group of $k[x_1,\dots, x_n]^G$ is $k^\times$. Version 2: Incorporates parts…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

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…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb Z_m$ such that $R=-R$, $T=-T$,…

We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…

Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…

Let (k1,k2,k3,k4) be a quartet of cyclic cubic number fields sharing a common conductor c=pqr divisible by exactly three prime(power)s p,q,r. For those components k of the quartet whose 3-class group Cl(3,k) = Z/3Z x Z/3Z is elementary…

Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

In this paper, we study the automorphism group and geodesic transitivity of a family of vertex-transitive graphs $H(n,k)$, introduced by Fu-Tao Hu \textit{et.al.} in 2010. In the process, we address some naturally arising, unanswered…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

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…

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $\sigma_t(G) \geq 2kt - t + 1$ for any two integers $k \geq 2$ and $t…