Finite $3$-connected-set-homogeneous locally $2\K_n$ graphs and $s$-arc-transitive graphs
Jinxin Zhou

TL;DR
This paper classifies finite 3-connected-set-homogeneous graphs that are locally 2K_n, showing they are line graphs of 2-arc-transitive graphs, and explores their automorphism groups to construct new examples.
Contribution
It completes the classification of certain 3-connected-set-homogeneous graphs and links them to line graphs of 2-arc-transitive graphs, expanding understanding of their structure.
Findings
All such graphs are line graphs of specific 2-arc-transitive graphs.
Characterization of graphs with solvable automorphism groups.
Construction of new 3-connected-set-homogeneous and 2-arc-transitive graphs.
Abstract
In this paper, all graphs are assumed to be finite. For and a graph , if for every pair of isomorphic connected induced subgraphs on at most vertices there exists an automorphism of mapping the first to the second, then we say that is -connected-set-homogeneous, and if every isomorphism between two isomorphic connected induced subgraphs on at most vertices can be extended to an automorphism of , then we say that is -connected-homogeneous. For , a graph is said to be locally if the subgraph induced on the set of vertices of adjacent to a given vertex is isomorphic to . Note that -connected-set-homogeneous but not -connected-homogeneous graphs are just the half-arc-transitive graphs which are a quite active topic in algebraic graph theory. Motivated by this, we posed the problem of…
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
TopicsAdvanced Graph Theory Research · Nuclear Receptors and Signaling · Finite Group Theory Research
