Рашит Тагирович Файзуллин, Alexander Prolubnikov
Abstract
Open-access reader
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
Key concepts: Graph isomorphism, Subgraph isomorphism problem, Induced subgraph isomorphism problem, Graph automorphism, Isomorphism (crystallography), Graph, Algorithm, Computer science