Dense and Symmetric Graph Formulation and Generation for Wireless Information Networks

Dense and symmetric graphs are useful for modeling fast information distribution in wireless information networks. In this paper, the authors focus on a specific family of dense and symmetric graphs, the Borel Cayley graphs. More specifically, they investigate the various parameters in the original formulation of Borel Cayley graphs defined in the matrix domain. By eliminating redundant parameters, they propose a new and simpler formulation of Borel Cayley graphs. This new formulation is defined in the integer domain and the group operation resembles the generation of pseudo-random numbers, hence the name pseudo-random formulation.