Cloning operations and graph diameter-Reference-Cited by-同舟云学术

Cloning operations and graph diameter

Published:2024-08-01 Issue:4 Volume:34 Page:207-210
ISSN:0924-9265
Container-title:Discrete Mathematics and Applications
language:en
Short-container-title:

Author:

Iordanskiy Mikhail A.¹

Affiliation:

1. Lobachevsky State University of Nizhny Novgorod; Minin Nizhny Novgorod State Pedagogical University , Nizhny Novgorod Russia

Abstract

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.

Publisher

Walter de Gruyter GmbH

Link

https://www.degruyter.com/document/doi/10.1515/dma-2024-0017/pdf

Reference9 articles.

1. Iordanskiy M. A., “Constructive descriptions of graphs”, Diskretniy analiz i issledovanie operatsiy, 3:4 (1996), 35–63 (in Russian).

2. Iordanskiy M. A., Constructive graph theory and its applications, N. Novgorod: Kirillitsa, 2016 (in Russian), 172 pp.

3. Iordanski M. A., “Constructive graph theory: generation methods, structure and dynamic characterization of closed classes of graphs - a survey.”, arXiv:2011.10984 (2020).

4. Iordanskiy M. A., “Graph Cloning”, Problems of theoretical cybernetics, Mater. XVIII mezhdunar. konf. (Penza), MAKS Press, Moscow, 2017, 108–110 (in Russian).

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).