Concentration properties of semi-vertex transitive graphs and random bi-coset graphs
Combinatorics
2012-10-23 v1
Abstract
It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is isomorphic to a bi-coset graph. In this paper, we prove that random bi-coset graphs are almost always concentrators, and construct some examples of semi-vertex transitive concentrators.
Keywords
Cite
@article{arxiv.1210.5587,
title = {Concentration properties of semi-vertex transitive graphs and random bi-coset graphs},
author = {Xingchao Deng and Kainan Xiang},
journal= {arXiv preprint arXiv:1210.5587},
year = {2012}
}
Comments
expander grphs