Cloning operations and graph diameter
-
Mikhail A. Iordanskiy
Abstract
The influence of the subgraph cloning operation on the graph diameter is studied. The corresponding potential increase in the diameter is estimated. Conditions under which the subgraph cloning operation causes no change in the graph diameter are formulated. An example of using the cloning operation to construct a family of fat trees is presented. The diameter of such graphs and the complexity of their design are estimated.
Originally published in Diskretnaya Matematika (2022) 34, №2, 26–31 (in Russian).
References
[1] Iordanskiy M. A., “Constructive descriptions of graphs”, Diskretniy analiz i issledovanie operatsiy, 3:4 (1996), 35–63 (in Russian).Search in Google Scholar
[2] Iordanskiy M. A., Constructive graph theory and its applications, N. Novgorod: Kirillitsa, 2016 (in Russian), 172 pp.Search in Google Scholar
[3] Iordanski M. A., “Constructive graph theory: generation methods, structure and dynamic characterization of closed classes of graphs - a survey.”, arXiv:2011.10984 (2020).Search in Google Scholar
[4] Iordanskiy M. A., “Graph Cloning”, Problems of theoretical cybernetics, Mater. XVIII mezhdunar. konf. (Penza), MAKS Press, Moscow, 2017, 108–110 (in Russian).Search in Google Scholar
[5] Iordanskiy M. A., “On the complexity of graph synthesis by cloning operations”, Diskretnaya matematika i ee prilozheniya, Mater. XIII mezhdunar. sem. (Moscow), izd-vo mekh.-matem. f-ta MGU, Moscow, 2019, 220–223 (in Russian).Search in Google Scholar
[6] Rappoport A. M., “Metric characteristics of communication network graphs”, Trudy In-ta sistemn. analiza Rossiyskoy akademii nauk, 14 (2005), 141–147 (in Russian).Search in Google Scholar
[7] Melentiev V. A., “On scalability of computing systems with compact topology”, Theor. Appl. Sci., 11:43 (2016), 164–169.10.15863/TAS.2016.11.43.30Search in Google Scholar
[8] Leiserson C. E., “Fat-trees: universal networks for hardware-efficient supercomputing”, IEEE Trans. Comput., C-34 (1985), 892–901.10.1109/TC.1985.6312192Search in Google Scholar
[9] Berge C., The theory of graphs and its applications, London: Methuen, 1962.Search in Google Scholar
© 2024 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- On large deviations of the moment of attaining far level by the random walk in a random environment
- Asymptotic local lower deviations of strictly supercritical branching process in a random environment with geometric distributions of descendants
- Cloning operations and graph diameter
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- On the maximal size of tree in a random forest
- Deciding multiaffinity of polynomials over a finite field
- Probability that given vertices belong to the same connected component of random equiprobable mapping
Articles in the same Issue
- Frontmatter
- On large deviations of the moment of attaining far level by the random walk in a random environment
- Asymptotic local lower deviations of strictly supercritical branching process in a random environment with geometric distributions of descendants
- Cloning operations and graph diameter
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- On the maximal size of tree in a random forest
- Deciding multiaffinity of polynomials over a finite field
- Probability that given vertices belong to the same connected component of random equiprobable mapping
