The following problem is considered: if H is a semiregular abelian subgroup of a transitive permutation group G acting on a finite set X, find conditions for (non)existence of G -invariant partitions of X. Conditions presented in this paper are derived by studying spectral properties of associated G -invariant digraphs. As an essential tool, irreducible complex characters of H are used. Questions of this kind arise naturally when classifying combinatorial objects which enjoy a certain degree of symmetry. As an illustration, a new and short proof of an old result of Frucht et al. (Proc Camb Philos Soc 70:211–218, 1971) classifying edge-transitive generalized Petersen graphs, is given.
COBISS.SI-ID: 1536772036
A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.
COBISS.SI-ID: 1537078468
In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs.
COBISS.SI-ID: 1536920004