{"title":"列举给定顺序的图的计算算法","authors":"A. Magomedov, S. Lavrenchenko","doi":"10.31029/demr.16.1","DOIUrl":null,"url":null,"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$. \nThe 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.","PeriodicalId":431345,"journal":{"name":"Daghestan Electronic Mathematical Reports","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computational algorithm for enumerating graphs of a given order\",\"authors\":\"A. Magomedov, S. Lavrenchenko\",\"doi\":\"10.31029/demr.16.1\",\"DOIUrl\":null,\"url\":null,\"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$. \\nThe 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.\",\"PeriodicalId\":431345,\"journal\":{\"name\":\"Daghestan Electronic Mathematical Reports\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Daghestan Electronic Mathematical Reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31029/demr.16.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Daghestan Electronic Mathematical Reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31029/demr.16.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computational algorithm for enumerating graphs of a given order
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
