Ramanujan Graphs with Small Girth
组合数学
2007-05-23 v1 群论
摘要
We construct an infinite family of (q+1)-regular Ramanujan graphs X_n of girth 1. We also give covering maps X_{n+1} --> X_n such that the minimal common covering of all the graphs is the universal covering tree.
关键词
引用
@article{arxiv.math/0306196,
title = {Ramanujan Graphs with Small Girth},
author = {Yair Glasner},
journal= {arXiv preprint arXiv:math/0306196},
year = {2007}
}
备注
14 pages, 1 figure. to appear: Combinatorica