On finite 2-distance-primitive graphs

From MaRDI portal
(Redirected from Publication:6542011)





A vertex-transitive graph is called 2-distance-primitive if the vertex stabilizer is primitive on both the first-step and the second-step neighborhoods. The paper under review shows that there are infinitely many 2-distance-primitive graphs with unbounded large valency and diameter, gives a classification of the 2-distance-primitive graphs with valency at most 9, and determines all the 2-distance-primitive graphs with the order of a product of two primes.



Cites work









This page was built for publication: On finite 2-distance-primitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542011)