A note on the degree-diameter problem for arc-transitive graphs
Combinatorics
2013-12-24 v1
Abstract
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
Keywords
Cite
@article{arxiv.1312.6337,
title = {A note on the degree-diameter problem for arc-transitive graphs},
author = {Sanming Zhou},
journal= {arXiv preprint arXiv:1312.6337},
year = {2013}
}
Comments
This is the version published in: Bull. of the ICA 68 (2013), 102-105