Distance-Transitive Graphs of Valency Four
From MaRDI portal
Cited in
(12)- Distance-transitive representations of the symmetric groups
- Distance-transitive graphs of valency 5, 6 and 7
- Distance-transitive graphs of valency five
- On geodesic transitive graphs
- The diameter of bipartite distance-regular graphs
- Two-geodesic transitive graphs of valency six
- Distance-regular graphs and (s,c,a,k)-graphs
- On bipartite tetra0alent graphs
- Distance-transitive graphs and generalized polygons
- Bounding the diameter of a distance-transitive graph
- There are only finitely many finite distance-transitive graphs of given valency greater than two
- Two-distance transitive normal Cayley graphs
This page was built for publication: Distance-Transitive Graphs of Valency Four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770979)