相关论文: Automorphism groups of rational circulant graphs t…

In 1993, Muzychuk \cite{muzychuk} showed that the rational Schur rings over a cyclic group $Z_n$ are in one-to-one correspondence with sublattices of the divisor lattice of $n$, or equivalently, with sublattices of the lattice of subgroups…

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

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…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

Schur rings are a type of subring of the group ring that is spanned by a partition of the group that meets certain conditions. Past literature has exclusively focused on the finite group case. This paper extends many classic results about…

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Schur rings over the infinite dihedral group $\mathcal{Z}\rtimes\mathcal{Z}_2$ are studied according to properties of Schur rings over infinite groups and the classification of Schur rings over infinite cyclic groups. Schur rings over…

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…

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…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…