Структура проективно площинних підграфів графів-обструкцій заданої поверхні

Thumbnail Image




Петренюк, В. І.
Петренюк, Д. А.
Оришака, О. В.
Petrenjuk, V.
Petrenjuk, D.
Oryshaka, O.

Journal Title

Journal ISSN

Volume Title


Інститут кібернетики імені В.М. Глушкова НАН України


Розглядається задача дослідження метричних властивостей площинних та проективних підграфів графів-обструкцій неорієнтованого роду k , k  2 . Основний результат: теореми 1, 2 і лема 3 як основа для алгоритма побудови прототипів графа-обструкції заданого неорієнтованого роду. Consider the problem of studying the metric properties of a subgraph G\v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow constructing prototypes of graphs-obstruction with number of vertices greater than 10 nonorientable genus greater than 1. This problem is related to Erdosh's hypothesis [3] on the coverage of obstruction graphs of an undirected surface of the genus k, where k> 0, the smallest inclusion of the set of k + 1st graph of the homeomorphic K5, or K3,3, in [4] constructively proved for 35 minors of obstruction graphs of the projective plane, a set of 62 with no more than 10 vertices of obstruction graphs and their splits for the Klein surface, as well as some obstruction graphs for other surfaces. In [5], the existence of a finite set of obstruction graphs for a non-orienting surface was proved. A similar problem was considered in [6], where models or prototypes of obstruction graphs were considered. The prototype of the graph-obstruction of the undirected genus, we will call the graphs that have their own subgraph graph-obstruction of the undirected genus. In [7, 8] the tangent problem of covering the set of vertices with the smallest number of cycles-boundaries of 2-cells was considered, the concept of cell distance is given in [9, 10], where the boundaries of an oriented genus of graphs formed from planar graphs and a simple star glued to some of its peaks. Hypothetically, it is possible to obtain them by recursive φ-transformation of the graph-obstruction of the projective plane and a copy of its planar subgraph given on vertices, edges or parts of edges, or simple chains, i.e. achievable parts of the so-called graph-basis (graph of homeomorphic graph Kuratovsky plane). We assume that instead of one subgraph there can be several copies of subgraphs of graphs-obstructions of the projective plane.The article has an introduction and two parts, in which the structural properties of subgraphs of obstruction graphs for an undirected surface, presented as a φ-image of one of the Kuratovsky graphs and at least one planar graph, are investigated. The metric properties of the minimal embeddings of the subgraphs of the obstruction graphs for undirected surfaces are considered, and the main result is Theorems 1, 2, and Lemma 3 as the basis of the prototype construction algorithm.



фи-пеpетвоpення гpафiв, прототипи графів-обструкцій, неорієнтована поверхня, φ-transformation of graphs, nonorientable surface, prototypes of graph-obstruction


Петренюк, В. I. Структура проективно площинних підграфів графів-обструкцій заданої поверхні / В. I. Петренюк, Д. А. Петренюк, О. В. Оришака // Кібернетика та комп'ютерні технології : зб. наук. пр. - Київ : Ін-т кібернетики ім. В.М. Глушкова НАН України, 2022. - № 2. - С. 13-30.