Distance-Transitive Graphs of Valency Four
From MaRDI portal
Publication:4770979
DOI10.1112/jlms/s2-8.2.377zbMath0285.05109OpenAlexW2088642333MaRDI QIDQ4770979
No author found.
Publication date: 1974
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-8.2.377
Related Items
Distance-transitive representations of the symmetric groups ⋮ Two-geodesic transitive graphs of valency six ⋮ Two-distance transitive normal Cayley graphs ⋮ Distance-transitive graphs of valency five ⋮ The diameter of bipartite distance-regular graphs ⋮ On geodesic transitive graphs ⋮ Distance-transitive graphs of valency 5, 6 and 7 ⋮ Bounding the diameter of a distance-transitive graph ⋮ There are only finitely many finite distance-transitive graphs of given valency greater than two ⋮ Distance-regular graphs and (s,c,a,k)-graphs ⋮ On bipartite tetra0alent graphs ⋮ Distance-transitive graphs and generalized polygons
This page was built for publication: Distance-Transitive Graphs of Valency Four
