368 research outputs found

    A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions

    Get PDF
    AbstractWe show that the result of Watkins (1990) [19] on constructing vertex-transitive non-Cayley graphs from line graphs yields a simple method that produces infinite families of vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions. We also prove that the graphs arising this way are hamiltonian provided that their valency is at least six

    Distance-regular Cayley graphs with small valency

    Full text link
    We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most 44, the Cayley graphs among the distance-regular graphs with known putative intersection arrays for valency 55, and the Cayley graphs among all distance-regular graphs with girth 33 and valency 66 or 77. We obtain that the incidence graphs of Desarguesian affine planes minus a parallel class of lines are Cayley graphs. We show that the incidence graphs of the known generalized hexagons are not Cayley graphs, and neither are some other distance-regular graphs that come from small generalized quadrangles or hexagons. Among some ``exceptional'' distance-regular graphs with small valency, we find that the Armanios-Wells graph and the Klein graph are Cayley graphs.Comment: 19 pages, 4 table

    Finite 33-connected homogeneous graphs

    Full text link
    A finite graph \G is said to be {\em (G,3)(G,3)-((connected)) homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most 33 extends to an automorphism g∈Gg\in G of the graph, where GG is a group of automorphisms of the graph. In 1985, Cameron and Macpherson determined all finite (G,3)(G, 3)-homogeneous graphs. In this paper, we develop a method for characterising (G,3)(G,3)-connected homogeneous graphs. It is shown that for a finite (G,3)(G,3)-connected homogeneous graph \G=(V, E), either G_v^{\G(v)} is 22--transitive or G_v^{\G(v)} is of rank 33 and \G has girth 33, and that the class of finite (G,3)(G,3)-connected homogeneous graphs is closed under taking normal quotients. This leads us to study graphs where GG is quasiprimitive on VV. We determine the possible quasiprimitive types for GG in this case and give new constructions of examples for some possible types
    • …
    corecore