Computational algorithm for enumerating graphs of a given order

A. M. Magomedov^a, S. Lawrencenko<sup>b

a</sup> Daghestan Scientific Centre of Russian Academy of Sciences, Makhachkala
^b Russian State University of Tourism and Service, Cherkizovo, Pushkino district, Moscow region

Abstract: For a given set $M$ of bigraphs of a given order, an algorithm is developed for constructing a set of representatives of the isomorphism classes of $M$. The algorithm is designed as a function defined in terms of nested loops; each set of values of the cycle counters ("indexer") defines an isomorphism class whose representative is assigned to the indexer.

Keywords: enumeration, bipartite graph, isomorphism, program, calculations.

UDC: 519.178

Received: 29.08.2021
Revised: 15.10.2021
Accepted: 23.11.2021

DOI: 10.31029/demr.16.1