A note on the degree-diameter problem for arc-transitive graphs
classification
🧮 math.CO
keywords
arc-transitiveboundsdegreedegree-diameterdiametergivegivengraph
read the original abstract
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.