Concentration properties of semi-vertex transitive graphs and random bi-coset graphs
From MaRDI portal
Publication:6236514
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.
This page was built for publication: Concentration properties of semi-vertex transitive graphs and random bi-coset graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236514)
