\(\omega\)-periodic graphs
The electronic journal of combinatorics, Tome 12 (2005)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
$\omega$-Periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are amenable. We also provide examples of $\omega$-periodic graphs which have exponential volume growth, non-linear polynomial volume growth and intermediate volume growth.
Itai Benjamini; Christopher Hoffman. \(\omega\)-periodic graphs. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1943
@article{10_37236_1943,
author = {Itai Benjamini and Christopher Hoffman},
title = {\(\omega\)-periodic graphs},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1943},
zbl = {1098.05069},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1943/}
}
Cité par Sources :