Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777654 | Journal of Combinatorial Theory, Series B | 2017 | 20 Pages |
Abstract
Let G be a group and let S be an inverse-closed and identity-free generating set of G. The Cayley graph Cay(G,S) has vertex-set G and two vertices u and v are adjacent if and only if uvâ1âS. Let CAYd(n) be the number of isomorphism classes of d-valent Cayley graphs of order at most n. We show that logâ¡(CAYd(n))âÎ(d(logâ¡n)2), as nââ. We also obtain some stronger results in the case d=3.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Primož PotoÄnik, Pablo Spiga, Gabriel Verret,