Finite 3-connected homogeneous graphs

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…