12 research outputs found

    Finite edge-transitive dihedrant graphs

    Get PDF
    AbstractIn this paper, we first prove that each biquasiprimitive permutation group containing a regular dihedral subgroup is biprimitive, and then give a classification of such groups. The classification is then used to classify vertex-quasiprimitive and vertex-biquasiprimitive edge-transitive dihedrants. Moreover, a characterization of valencies of normal edge-transitive dihedrants is obtained, and some classes of examples with certain valences are constructed

    On 2-arc-transitivity of Cayley graphs

    Get PDF
    AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra. Combin. 5 (1996) 83–86) by Alspach, Conder, Xu and the author, motivates the main theme of this article: the study of 2-arc-transitive Cayley graphs of dihedral groups. First, a previously unknown infinite family of such graphs, arising as covers of certain complete graphs, is presented, leading to an interesting property of Singer cycles in the group PGL(2,q), q an odd prime power, among others. Second, a structural reduction theorem for 2-arc-transitive Cayley graphs of dihedral groups is proved, putting us—modulo a possible existence of such graphs among regular cyclic covers over a small family of certain bipartite graphs—a step away from a complete classification of such graphs. As a byproduct, a partial description of 2-arc-transitive Cayley graphs of abelian groups with at most three involutions is also obtained

    Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups

    Full text link
    Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural extension of the problem of characterizing strongly-regular Cayley graphs (or equivalently, regular partial difference sets). In this paper, we provide a partial characterization for distance-regular Cayley graphs over semi-dihedral groups and pseudo-semi-dihedral groups, both of which are 22-groups with a cyclic subgroup of index 22.Comment: 21 page

    A characterization of metacirculants

    Get PDF
    AbstractMetacirculants were introduced by Alspach and Parsons in 1982 and have been a rich source of various topics since then, including the Hamiltonian path problem in metacirculants. A metacirculant has a vertex-transitive metacyclic subgroup of automorphisms, and a long-standing interesting question in the area is if the converse statement is true, namely, whether a graph with a vertex-transitive metacyclic automorphism group is a metacirculant. We shall answer this question in the negative, and then present a classification of cubic metacirculants

    (Algebraic aspects of graph theory)

    Get PDF
    corecore