This article is cited in 1 paper

Scaling of graphs with diameter constraint

M. A. Iordanskii<sup>ab

a</sup> Lobachevski State University of Nizhni Novgorod
^b Minin Nizhny Novgorod State Pedagogical University

Abstract: The effect of subgraphs gluing and cloning operations on the graph diameter is studied. A vertex-diameter graph is a graph in which all vertices belong to diametric chains. We study the possibilities of using the vertex-diameter graphs for scaling of graphs with diameter constrains. Examples of scaling of trees, fat trees, and vertex-diameter graphs via cloning and gluing operations are given. We estimate the diameter and complexity of synthesis of such graphs.

Keywords: trees, fat trees, vertex-diameter graphs, diameter, dominating set with neighborhood, gluing and cloning operations.

UDC: 519.175.2

Received: 16.02.2023

DOI: 10.4213/dm1770

 English version: Discrete Mathematics and Applications, 2025, 35:3, 143–151

Bibliographic databases:

•