Symmetry properties of subdivision graphs
Ashraf Daneshkhah, Alice Devillers, Cheryl E. Praeger

TL;DR
This paper investigates the symmetry properties of subdivision graphs, establishing conditions under which they exhibit local s-arc and s-distance transitivity, and classifies certain cases while leaving some open problems.
Contribution
It provides a characterization of symmetry properties of subdivision graphs in relation to the original graph's transitivity, including new classifications for specific parameter ranges.
Findings
S(Σ) is locally s-arc transitive iff Σ is ⌈(s+1)/2⌉-arc transitive for connected Σ.
Diameter of S(Σ) is 2d+δ, with 0≤δ≤2, where d is the diameter of Σ.
Classification of graphs with local s-distance transitivity for s≤5 and s≥15+δ.
Abstract
The subdivision graph of a graph is obtained from by `adding a vertex' in the middle of every edge of . Various symmetry properties of are studied. We prove that, for a connected graph , is locally -arc transitive if and only if is -arc transitive. The diameter of is , where has diameter and , and local -distance transitivity of is defined for . In the general case where we prove that is locally -distance transitive if and only if is -arc transitive. For the remaining values of , namely , we classify the graphs for which is locally -distance…
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 · Advanced Graph Theory Research · graph theory and CDMA systems
