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 $0\leqslant \delta\leqslant 2s\S(\Sigma)$ 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 $\max{2d, 6}\leqslant s\leqslant \min{2d+\delta, 14+\delta}$ remain open.

生成讲解博客的中文版本

生成AI智能校验的中文版本