A classification of graphs whose subdivision graph is locally distance transitive

From MaRDI portal
Publication:1928291



Abstract: The subdivision graph S(Sigma) of a connected graph Sigma is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs Sigma such that S(Sigma) is locally (G,s)-distance transitive for sleq2,diam(Sigma)−1 and some GleqAut(Sigma). In this paper, we solve the remaining cases by classifying all the graphs Sigma such that the subdivision graphs is locally (G,s)-distance transitive for sgeq2,diam(Sigma) and some GleqAut(Sigma). In particular, their subdivision graph are always locally G-distance transitive, except for the complete graphs.












This page was built for publication: A classification of graphs whose subdivision graph is locally distance transitive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928291)