Construction of bipartite homogeneous minimal quasi-complete graphs of fault tolerant information systems

Graph theory models are widely used to create topology of the reliable, secure information systems, for example, data transmission networks. One of the directions in this area is the creation of quasi-complete bipartite graphs, which were proposed in the works of Professor Karavai M.F. from the Institute for Management Problems V. A. Trapeznikova RAS (Laboratory No. 27 "Technical diagnostics and fault tolerance"). However, to use the appropriate methods in the educational process in the disciplines of Discrete Mathematics, Graph Theory and its Applications, etc., methodological developments on this topic are needed for students, which would allow for practical and laboratory classes. The article is an attempt to create one of these techniques.