Creation of the mathematical apparatus for establishing the duality relation between the vertex separators and cuts in hypergraphs
Abstract:
The article introduces the pioneered concept of the strict line hypergraph and proves that the function of its formation is an involution. This background forms the basis for specifying the duality relation between the vertex separators and cuts in hypergraphs. All significant considerations are presented in the form of theorems accompanied with their rigorous proofs and discussions of the specific situations.
References:
A. Potebnia, "Representation of the Greedy Algorithms Applicability for Solving the Combinatorial Optimization Problems Based on the Hypergraph Mathematical Structure", The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM) 14th International Conference on, pp. 328-332, 2017.
View in Google ScholarA. Potebnia, "Method for Classification of the Computational Problems on the Basis of the Multifractal Division of the Complexity Classes", Problems of Infocommunications. Science and Technology (PIC S&T) Third International Scientific-Practical Conference on, pp. 1-4, 2016.
View in Google ScholarT. Evans and R. Lambiotte, "Line graphs link partitions and overlapping communities", Phys. Rev. E, vol. 80, no. 1, pp. 016105, 2009.
View in Google Scholar
