Finite $3$-connected homogeneous graphs
Abstract
A finite graph is said to be {\em -connected homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most extends to an automorphism of the graph, where is a group of automorphisms of the graph. In 1985, Cameron and Macpherson determined all finite -homogeneous graphs. In this paper, we develop a method for characterising -connected homogeneous graphs. It is shown that for a finite -connected homogeneous graph , either is --transitive or is of rank and has girth , and that the class of finite -connected homogeneous graphs is closed under taking normal quotients. This leads us to study graphs where is quasiprimitive on . We determine the possible quasiprimitive types for in this case and give new constructions of examples for some possible types.
Cite
@article{arxiv.1810.01535,
title = {Finite $3$-connected homogeneous graphs},
author = {Cai Heng Li and Jin-Xin Zhou},
journal= {arXiv preprint arXiv:1810.01535},
year = {2022}
}