Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs

Abstract

Modern network systems (unmanned aerial vehicles groups, social networks, network production chains, transport and logistics networks, communication networks, cryptocurrency networks) are distinguished by their multi-element nature and the dynamics of connections between its elements. A number of discrete problems on the construction of optimal substructures of network systems described in the form of various classes of graphs are NP-complete problems. In this case, the variability and dynamism of the structures of network systems leads to an "additional" complication of the search for solutions to discrete optimization problems. At the same time, for some subclasses of dynamical graphs, which are used to model the structures of network systems, conditions for the solvability of a number of NP-complete problems can be distinguished. is subclass of dynamic graphs includes pre-fractal graphs.e article investigates NP-complete problems on pre-fractal graphs: a Hamiltonian cycle, a skeleton with the maximum number of pendant vertices, a monochromatic triangle, a clique, an independent set. e conditions under which for some problems it is possible to obtain an answer about the existence and to construct polynomial (when xing the number of seed vertices) algorithms for nding solutions are identi ed.