Abstract
We begin with a discussion of orbit polynomial graphs and their relationship with distance-transitive, distance-regular and distance polynomial graphs. After finding a simple classification of the orbit polynomial graphs with a prime number of vertices, we use this result to provide short proofs of the classification of symmetric and distance-transitive graphs of prime order.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
