A note on the degree-diameter problem for arc-transitive graphs
Sanming Zhou
TL;DR
This paper establishes new lower bounds on the maximum size of arc-transitive graphs with diameter two for a specified degree, advancing understanding of their structural limits.
Contribution
It provides two novel lower bounds on the order of arc-transitive graphs with diameter two, contributing to the degree-diameter problem in graph theory.
Findings
Derived two lower bounds for graph order
Focused on arc-transitive graphs with diameter two
Enhanced understanding of degree-diameter constraints
Abstract
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Finite Group Theory Research · Graph theory and applications