A classification of graphs whose subdivision graph is locally distance transitive
From MaRDI portal
Publication:1928291
Abstract: The subdivision graph of a connected graph 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 such that is locally -distance transitive for and some . In this paper, we solve the remaining cases by classifying all the graphs such that the subdivision graphs is locally -distance transitive for and some . In particular, their subdivision graph are always locally -distance transitive, except for the complete graphs.
Recommendations
Cites work
- Distance-preserving maps in generalized polygons. I: Maps on flags
- Distance-transitive graphs and generalized polygons
- scientific article; zbMATH DE number 3438905 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- On Minimal graphs of maximum even girth
- On Moore Graphs with Diameters 2 and 3
- On projective and affine planes with transitive collineation groups
- Symmetry properties of subdivision graphs
- The finite vertex-primitive and vertex-biprimitive \(s\)-transitive graphs for \(s\geq 4\)
Cited in
(2)
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)