Scaling of graphs with diameter constraint

References

[1] Iordanskij M. A., “Constructive descriptions of graphs”, Diskretn. Anal. Issled. Oper., 34 (1996), 35–63.Search in Google Scholar

[2] Ore O., Theory of graphs, AMS, 1962, 270 pp.10.1090/coll/038Search in Google Scholar

[3] Iordanskij M. A., Constructive graph theory and its applications, N. Novgorod: Kirillitsa, 2016 (in Russian), 172 pp., https://iordanskyma.files.wordpress.comSearch in Google Scholar

[4] Iordanski M. A., Constructive Graph Theory: Generation Methods, Structure and Dynamic Characterization of Closed Classes of Graphs - A Survey, 2020, 18 pp., arXiv: 2011.10984Search in Google Scholar

[5] Iordanskij M. A., “Graph cloning”, Problems of theoretical cybernetics, Mater. XVIII mezhdunar. konf. (Penza, 19–23 june 2017), M.: MAKS Press, 2017, 108–110 (in Russian).Search in Google Scholar

[6] Melentiev V. A., Shubin V. I., “On scalability of computing systems with compact topology”, Theor. Appl. Sci., 4311 (2016), 164–169.10.15863/TAS.2016.11.43.30Search in Google Scholar

[7] Iordanskij M. A., “Cloning operations and graph diameter”, Discrete Math. Appl., 344 (2024), 207–210.10.1515/dma-2024-0017Search in Google Scholar

[8] Iordanskij M. A., “On the complexity of graph synthesis by cloning operations”, Diskretnaya matematika i ee prilozheniya, Mater. XIII mezhdunar. sem, M.: Izd-vo mekh.-matem. f-ta MGU, 2019, 220–223 (in Russian).Search in Google Scholar

[9] Leiserson C. E., “Fat-trees: universal networks for hardware-efficient supercomputing”, IEEE Trans. Comput., 3410 (1985), 892–901.10.1109/TC.1985.6312192Search in Google Scholar

[10] Garey M. R., Johnson D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979, 338 pp.Search in Google Scholar