Abstract: This work inspired by a specifically constrained communication model. Given collections of communicating objects, and communication is by means of several relay centres. The complete cross connectivity of elements of different collections is the target, supposing that communicating objects differ by their connections to the relay centres. Such models exist only for proper object groups – when they have specific sizes and there is a corresponding number of relay points. We consider optimization problems studying the validity boundaries. Terms are combinatorial – geometry of binary cube, lexicographical orders, shadowing and isoperimetry. The main interest is methodological and aims at extending the consequences that can be delivered from the solution of the well known discrete isoperimetry problem.

Keywords: communication, optimization, isoperimetry.

ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics

Link:

CROSS INTERSECTION SEQUEL OF DISCRETE ISOPERIMETRY1

Levon Aslanyan, Vilik Karakhanyan

http://www.foibg.com/ijita/vol18/ijita18-3-p01.pdf