On almost distance-transitive graphs
From MaRDI portal
Recommendations
- Edge-symmetric distance-regular covers of cliques: affine case
- Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)
- Edge-symmetric distance-regular covers of cliques with =
- Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case
- Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
Cites work
- Antipodal distance transitive covers of complete graphs
- Covers of graphs and EGQs
- Edge-symmetric distance-regular covers of cliques with =
- Edge-symmetric distance-regular covers of cliques: affine case
- Geodesic graphs with homogeneity conditions
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
Cited in
(13)- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- On adjacency-transitive graphs
- Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
- Edge-symmetric distance-regular covers of cliques: affine case
- On top locally-\(s\)-distance-transitive graphs
- Turán type results for distance graphs
- Distance transitive graphs with symmetric or alternating automorphism group
- On the spectrum of a class of distance-transitive graphs
- Affine distance-transitive graphs with quadratic forms
- Orienting and separating distance-transitive graphs
- Distance-transitive strongly regular graphs
- Finite primitive distance-transitive graphs
- Distance degrees of vertex-transitive graphs
This page was built for publication: On almost distance-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393869)
