Smallest vertex-transitive graphs of given degree and diameter

Knor, Martin and Širáň, Jozef (2014). Smallest vertex-transitive graphs of given degree and diameter. Journal of Graph Theory, 75(2) pp. 137–149.

DOI: https://doi.org/10.1002/jgt.21727

Abstract

For every d and k, we determine the smallest order of a vertex-transitive graph of degree d and diameter k, and in each such case we show that this order is achieved by a Cayley graph.

Viewing alternatives

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

Recommendations