{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:15:54Z","timestamp":1768007754871,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11227-022-04421-7","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:05:32Z","timestamp":1648519532000},"page":"13915-13941","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Formal method for the synthesis of optimal topologies of computing systems based on the projective description of graphs"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4855-9589","authenticated-orcid":false,"given":"V. A.","family":"Melent\u2019ev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"4421_CR1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183122500401","author":"AF Zadorozhny","year":"2021","unstructured":"Zadorozhny AF, Melent\u2019ev VA (2021) On the topological compatibility of parallel tasks and computing systems. Int J Mod Phys C. https:\/\/doi.org\/10.1142\/S0129183122500401","journal-title":"Int J Mod Phys C"},{"key":"4421_CR2","unstructured":"Kalyayev IA, Levin II, Semernikov YeA (2009) Reconfigurable computing systems. J Gyrosco Nav, M, TSNII publ. http:\/\/fpga.parallel.ru\/papers\/kaljaev4.pdf"},{"key":"4421_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.25728\/pu.2020.5.7","volume":"5","author":"MF Karavai","year":"2020","unstructured":"Karavai MF, Podlazov VS (2020) Optimum multidimensional tori based on low-port routers and hubs. J Control problems 5:56\u201354. https:\/\/doi.org\/10.25728\/pu.2020.5.7","journal-title":"J Control problems"},{"key":"4421_CR4","unstructured":"Melent\u2019ev VA (2011) Compact structures of computer systems and their synthesis. J Large-Scale\u00a0Syst\u00a0Control.\u00a032:\u00a0241\u2013261 http:\/\/ubs.mtas.ru\/archive\/search_results_new.php?publication_id=18577 (in Russ.)."},{"key":"4421_CR5","first-page":"141","volume":"14","author":"AM Rappoport","year":"2005","unstructured":"Rappoport AM (2005) Metric characteristics of communication net graphs. Proc Inst Syst Anal Russian Acad Sci 14:141\u2013147","journal-title":"Proc Inst Syst Anal Russian Acad Sci"},{"key":"4421_CR6","unstructured":"Melent\u2019ev VA (2015) On the topological scalability of computing systems. J Large-Scale Syst\u00a0Control.\u00a058:\u00a0115\u2013143 http:\/\/ubs.mtas.ru\/archive\/search_results_new.php?publication_id=20724 (in Russian)"},{"key":"4421_CR7","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ Math 6:290\u2013297","journal-title":"Publ Math"},{"issue":"4","key":"4421_CR8","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN (1959) Random graphs. Ann Math Stat 30(4):1141\u20131144","journal-title":"Ann Math Stat"},{"issue":"3","key":"4421_CR9","first-page":"382","volume":"6","author":"J De Vries","year":"1889","unstructured":"De Vries J (1889) Over vlakke configuraties waarin elk punt met twee lijnen incident is. Verslagen en Mededeelingen der Koninklijke Akademie voor Wetenschappen, Afdeeling Natuurkunde 6(3):382\u2013407","journal-title":"Verslagen en Mededeelingen der Koninklijke Akademie voor Wetenschappen, Afdeeling Natuurkunde"},{"key":"4421_CR10","first-page":"67","volume":"5","author":"G Brinkmann","year":"2013","unstructured":"Brinkmann G, Goedgebeur J, Van Cleemput N (2013) Apr 1 The history of the generation of cubic graphs. J Chem Inf Model 5:67\u201389","journal-title":"J Chem Inf Model"},{"issue":"9","key":"4421_CR11","first-page":"1097","volume":"11","author":"AT Balaban","year":"1966","unstructured":"Balaban AT (1966) Valence-isomerism of cyclopolyenes. Rev Roum Chim 11(9):1097","journal-title":"Rev Roum Chim"},{"key":"4421_CR12","unstructured":"Bussemaker FC, Cobeljic S, Cvetkovic DM, Seidel JJ (1976) Computer investigation of cubic graphs. EUT report. WSK, Dept. of Mathematics and Computing Science: 76"},{"issue":"1","key":"4421_CR13","first-page":"246","volume":"31","author":"IA Faradzhev","year":"1976","unstructured":"Faradzhev IA (1976) Constructive enumeration of homogeneous graphs grafov. Uspekhi Matematicheskikh Nauk 31(1):246","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"4421_CR14","unstructured":"McKay BD, Royle GF (1985) Constructing the cubic graphs on up to 20 vertices. Department of Mathematics, University of Western Australia"},{"key":"4421_CR15","unstructured":"Brinkmann G (1992) Generating cubic graphs faster than isomorphism checking. Universit\u00e4t Bielefeld. SFB 343. Diskrete Strukturen in der mathematik"},{"issue":"2","key":"4421_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","volume":"30","author":"M Meringer","year":"1999","unstructured":"Meringer M (1999) Fast generation of regular graphs and construction of cages. J of Graph Theory 30(2):137\u2013146","journal-title":"J of Graph Theory"},{"key":"4421_CR17","doi-asserted-by":"crossref","unstructured":"Brinkmann G, Goedgebeur J, McKay BD (2011) Generation of cubic graphs. Discret Math Theo Comput Sci 13(2): 69\u201379","DOI":"10.46298\/dmtcs.551"},{"issue":"9","key":"4421_CR18","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1021\/ed061p766","volume":"61","author":"AT Balaban","year":"1984","unstructured":"Balaban AT, Banciu M (1984) Schemes and transformations in the (CH) 2k series: valence isomers of [8]-and [10] annulene. J Chem Ed 61(9):766","journal-title":"J Chem Ed"},{"key":"4421_CR19","doi-asserted-by":"crossref","unstructured":"Bretto A, Gillibert L (2007) G-graphs for the cage problem: a new upper bound. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pp. 49\u201353.","DOI":"10.1145\/1277548.1277556"},{"key":"4421_CR20","unstructured":"Cage graph from WolframMathWorld.https:\/\/mathworld.wolfram.com\/CageGraph.html"},{"key":"4421_CR21","first-page":"34","volume":"4","author":"VA Melentiev","year":"2000","unstructured":"Melentiev VA (2000) The bracket form of graph description and its use in the structural investigation of robust computer systems. Optoelectron Instrum Data Process 4:34\u201347","journal-title":"Optoelectron Instrum Data Process"},{"key":"4421_CR22","unstructured":"Melent'ev VA (2005) Formal approach to investigating the structures of computing systems. News bullet. of the Tomsk State University. Appendix 14: 167\u2013172 (in Russian)"},{"key":"4421_CR23","doi-asserted-by":"crossref","unstructured":"Melent\u2019ev VA (2010) An analytical approach to the synthesis of regular graphs with the preset values of order, degree and girth. J Appl Discr Math 2(8): 74\u201386. http:\/\/journals.tsu.ru\/uploads\/import\/1138\/files\/03-074.pdf (in Russian)","DOI":"10.17223\/20710410\/8\/8"},{"key":"4421_CR24","doi-asserted-by":"publisher","unstructured":"Kornushko VF, Panov AV, Bogunova IV, Nikolayeva OM, Flid AA (2018) System approach to the informational support of pharmaceutical development of finished medicinal products. J Fine Chem Tech 13(2): 91\u201399. https:\/\/doi.org\/10.32362\/2410-6593-2018-13-2-91-99","DOI":"10.32362\/2410-6593-2018-13-2-91-99"},{"key":"4421_CR25","unstructured":"Gromov YuYu, Eliseev AI, Minin YuV, Sumin VI (2018) Analysis of reliability in network information systems. Vestnik of Voronezh Institute of the Russian Federal Penitentiary Service 1: 33\u201341 https:\/\/www.elibrary.ru\/item.asp?id=32822922 (in Russian.)"},{"key":"4421_CR26","doi-asserted-by":"publisher","unstructured":"Volkova AA (2018) Technical translation of Melentiev's graph representation method with commentary. University Honors Theses. Paper 503, https:\/\/doi.org\/10.15760\/honors.507","DOI":"10.15760\/honors.507"},{"key":"4421_CR27","unstructured":"Melent\u2019ev VA (2005) Problems of isomorphism and tolerance of graphs in the systems fault-tolerance theory, In: Proceedings of the IV International Conference System Identification and Control Problems SICPRO\u201905. Institute of Control Sciences, Moscow, Russia 532\u2013549 (in Russian)"},{"key":"4421_CR28","doi-asserted-by":"publisher","unstructured":"Melent\u2019ev VA (2018) Use of Melentiev's graph representation method for the detection of cliques and the analysis of computing systems topologies. J Theor Appl Sci 12(68): 201\u2013211. https:\/\/doi.org\/10.15863\/TAS.2018.12.68.28","DOI":"10.15863\/TAS.2018.12.68.28"},{"key":"4421_CR29","doi-asserted-by":"publisher","unstructured":"Melent\u2019ev VA (2018) Use of Melentiev\u2019s graph representation method for the identification and enumeration of circuits of the given length. J Theor Appl Sci 11(67): 85\u201391 https:\/\/doi.org\/10.15863\/TAS.2018.11.67.16","DOI":"10.15863\/TAS.2018.11.67.16"},{"key":"4421_CR30","doi-asserted-by":"publisher","unstructured":"Melent\u2019ev VA (2020) Author\u2019s approach to topological modeling of parallel computation systems. J Mech Contin Math Sci. 8: 224\u2013237. https:\/\/doi.org\/10.26782\/jmcms.spl.8\/2020.04.00017","DOI":"10.26782\/jmcms.spl.8\/2020.04.00017"},{"key":"4421_CR31","unstructured":"Melent\u2019ev VA (2011) Compact graphs and the deterministic algorithm for their synthesis. J Appl Discr Math. Supplement 4: 94\u201396 http:\/\/journals.tsu.ru\/uploads\/import\/1140\/files\/04-094.pdf"},{"key":"4421_CR32","unstructured":"Melent\u2019ev VA (2012) The metrics, cyclomatics and synthesis of systems and networks topology, In: Proceedings of the VI international conference \u201cparallel computation and control problems \u201cPACO\u201d. Moscow, Russia. ICS RAS: 10\u201325 https:\/\/www.elibrary.ru\/download\/elibrary_22249411_40115945.pdf (in Russian)"},{"key":"4421_CR33","unstructured":"Goubko MV Algorithmic methods of solving tasks of discrete optimization. https:\/\/docplayer.ru\/41920534-Lekciya-z-algoritmicheskie-metody-resheniya-zadach-diskretnoy-optimizacii.html."},{"key":"4421_CR34","unstructured":"Harary F (1978) Graph theory. M.: Mir publ, 300"},{"issue":"1","key":"4421_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190060103","volume":"6","author":"P Wong","year":"1982","unstructured":"Wong P (1982) Cages \u2013 a survey. J Graph Theory 6(1):1\u201322","journal-title":"J Graph Theory"},{"issue":"4","key":"4421_CR36","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/COMST.2004.5342296","volume":"6","author":"JR D\u00e9gila","year":"2004","unstructured":"D\u00e9gila JR, Sanso BA (2004) Survey of topologies and performance measures for large-scaled networks. J IEEE Commun Surv Tutor 6(4):18\u201331","journal-title":"J IEEE Commun Surv Tutor"},{"key":"4421_CR37","doi-asserted-by":"crossref","unstructured":"Wong PK (1983) On the smallest graphs of girth 10 and valence 3. Discr Math 43(1): 119\u2013124","DOI":"10.1016\/0012-365X(83)90029-8"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04421-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T16:39:55Z","timestamp":1658162395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04421-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,26]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4421"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04421-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,26]]},"assertion":[{"value":"28 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}