Abstract
As a consequence of a famous theorem by Derek Smith, an unknown distance-transitive graph is either primitive of diameter at least two and valency at least three or is antipodal, bipartite, or both. In the imprimitive cases an unknown graph must have a primitive core of diameter at least two and valency at least three. It seems that the known list of primitive graphs is complete. Here, starting from an earlier work by Brouwer and Van Bon, we find every distance-transitive antipodal cover whose primitive quotient is one of the known distance-transitive graphs of diameter two and valency at least three.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
