Finite $3$-connected homogeneous graphs
Cai Heng Li, Jin-Xin Zhou

TL;DR
This paper characterizes finite (G,3)-connected homogeneous graphs, showing they are either 2-transitive or of rank 3 with girth 3, and explores their structure and examples.
Contribution
It develops a new method for characterizing (G,3)-connected homogeneous graphs and classifies their quasiprimitive automorphism group types.
Findings
Either G_v^{Γ(v)} is 2-transitive or of rank 3 with girth 3.
The class of such graphs is closed under normal quotients.
New examples for certain quasiprimitive types are constructed.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
