Approximation theory

Daghestan Electronic Mathematical Reports: Issue 16 (2021)


Computational algorithm for enumerating graphs of a given order

UDK: 519.178

Pages: 1 - 15


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.




To issue content

Download full text