Year: 2017
Type: article
Abstract: To determine that two given undirected graphs are isomorphic, weconstruct for them auxiliary graphs, using the breadth-first search.This makes capability to position vertices in each digraph with respectto each other. If the given graphs are isomorphic, in each of them wecan find such positionally equivalent auxiliary digraphs that have thesame mutual positioning of vertices. Obviously, if the given graphs areisomorphic, then such equivalent digraphs exist. Proceeding from thearrangement of vertices in one of the digraphs, we try to determine thecorresponding vertices in another digraph. As a result we develop analgorithm for constructing a bijective mapping between vertices of thegiven graphs if they are isomorphic. The running time of the algorithmequal toO(n5), where n is the number of graph vertices.
DOI: 10.14738/tnc.55.3551
Author: Anatoly D. Plotnikov
Institution: Volodymyr Dahl East Ukrainian National University
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2767461202