Cloning operations and graph diameter

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.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics and Applications
Published
2024-08-01
DOI
https://doi.org/10.1515/dma-2024-0017
Citations
2
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
2.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cloning operations and graph diameter

Mikhail A. Iordanskiy
2 citations
Discrete Mathematics and Applications
Graph theory and applications
2.02
article

Cloning operations and graph diameter

Mikhail A. Iordanskiy
article en
2 citations

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.

Discrete Mathematics and ApplicationsVol. 34(4)
Nizhny Novgorod State Pedagogical University (RU), N. I. Lobachevsky State University of Nizhny Novgorod (RU)
Openalex Percentile: Top 15%
Graph theory and applications
2.02
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.