Geodesic
Computational algorithm for enumerating graphs of a given order
Daghestan Electronic Mathematical Reports, Tome 16 (2021), pp. 1-15

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DEMR_2021_16_a0,
     author = {A. M. Magomedov and S. Lawrencenko},
     title = {Computational algorithm for enumerating graphs of a given order},
     journal = {Daghestan Electronic Mathematical Reports},
     pages = {1--15},
     publisher = {mathdoc},
     volume = {16},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DEMR_2021_16_a0/}
}
TY  - JOUR
AU  - A. M. Magomedov
AU  - S. Lawrencenko
TI  - Computational algorithm for enumerating graphs of a given order
JO  - Daghestan Electronic Mathematical Reports
PY  - 2021
SP  - 1
EP  - 15
VL  - 16
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DEMR_2021_16_a0/
LA  - ru
ID  - DEMR_2021_16_a0
ER  - 
%0 Journal Article
%A A. M. Magomedov
%A S. Lawrencenko
%T Computational algorithm for enumerating graphs of a given order
%J Daghestan Electronic Mathematical Reports
%D 2021
%P 1-15
%V 16
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DEMR_2021_16_a0/
%G ru
%F DEMR_2021_16_a0
A. M. Magomedov; S. Lawrencenko. Computational algorithm for enumerating graphs of a given order. Daghestan Electronic Mathematical Reports, Tome 16 (2021), pp. 1-15. http://geodesic.mathdoc.fr/item/DEMR_2021_16_a0/