Stability of graph pairs involving vertex-transitive graphs
Yan-Li Qin, Binzhou Xia, Sanming Zhou

TL;DR
This paper investigates the stability of pairs of vertex-transitive graphs, reducing the problem to a well-studied case involving the graph K2, thereby enabling easier determination of stability for broader classes.
Contribution
It reduces the stability analysis of regular vertex-transitive graph pairs with coprime valencies to the case involving K2, simplifying the problem significantly.
Findings
Stability of graph pairs can be reduced to the case involving K2.
Determines stability for pairs with coprime valencies when one graph is vertex-transitive.
Provides a method to analyze stability using known results for K2.
Abstract
A pair of graphs is said to be stable if the full automorphism group of is isomorphic to the product of the full automorphism groups of and and unstable otherwise, where is the direct product of and . In this paper, we reduce the study of the stability of any pair of regular graphs with coprime valencies and vertex-transitive to that of . Since the latter is well studied in the literature, this enables us to determine the stability of any pair of regular graphs with coprime valencies in the case when is vertex-transitve and the stability of is known.
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 · Bipolar Disorder and Treatment
