Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2023, Volume 35, Issue 4, Pages 46–57
DOI: https://doi.org/10.4213/dm1770 (Mi dm1770) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Scaling of graphs with diameter constraint

M. A. Iordanskiiab

a Lobachevski State University of Nizhni Novgorod
b Minin Nizhny Novgorod State Pedagogical University
Full-text PDF (494 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1770
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.
Received: 16.02.2023
Published: 28.11.2023
English version:
Discrete Mathematics and Applications, 2025, Volume 35, Issue 3, Pages 143–151
DOI: https://doi.org/10.1515/dma-2025-0010
Document Type: Article
UDC: 519.175.2
Language: Russian
Citation: M. A. Iordanskii, “Scaling of graphs with diameter constraint”, Diskr. Mat., 35:4 (2023), 46–57; Discrete Math. Appl., 35:3 (2025), 143–151
Citation in format AMSBIB
\Bibitem{Ior23}
\by M.~A.~Iordanskii
\paper Scaling of graphs with diameter constraint
\jour Diskr. Mat.
\yr 2023
\vol 35
\issue 4
\pages 46--57
\mathnet{http://mi.mathnet.ru/dm1770}
\crossref{https://doi.org/10.4213/dm1770}
\transl
\jour Discrete Math. Appl.
\yr 2025
\vol 35
\issue 3
\pages 143--151
\crossref{https://doi.org/10.1515/dma-2025-0010}
Linking options:
  • https://www.mathnet.ru/eng/dm1770
  • https://doi.org/10.4213/dm1770
  • https://www.mathnet.ru/eng/dm/v35/i4/p46
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025