paper

Symmetry properties of subdivision graphs

arXiv:1008.2261

Abstract

The subdivision graph of a graph is obtained from by `adding a vertex' in the middle of every edge of $\Si$. 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 transitive in the cases, and . The cases remain open.