KIAM Main page Web Library  •  Publication Searh  Русский 

Conference material: "Academician O.B. Lupanov XIV International Scientific Seminar "Discrete Mathematics and Its Applications" (20-25 June 2022, Moscow)"
Authors: Kurapov S.V., Davidovsky M.V.
Diakoptics and structures of graph
In this paper, we consider the issues of determining the isomorphism separable graphs. It is shown that for a graph of any kind it is possible apply the methods of diacoptics, that is, divide the set of vertices of the graph into two subsets. The first subset of vertices characterizes non-separable part of the graph and is a non-separable graph. The second subset characterizes the additional part of the graph and consists from certain parts of the graph. The first stage of checking isomorphism consists in checking the isomorphism of non-separable parts of graphs. Then additional parts of the graphs are checked for compliance. If the inseparable part and the complementary parts are isomorphic, then are isomorphic and separable graphs.
graph isomorphism
Publication language: russian,  pages: 3 (p. 194-196)
Russian source text:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Kurapov Sergey Vsevolodovich,  Zaporozhye National University
  • Davidovsky Maxim Vladimirovich,  Zaporozhye Institute of Postgraduate Pedagogical Education