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) 		 
Scaling 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) First page
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1770
Abstract: The influence of the gluing and cloning on operations of subgraphs on the graph diameter is studied. The vertex-diameter graphs are defined as graphs, all vertices of which belong to diametric chains. The possibilities of their use in scaling graphs with a diameter limitation are considered. Examples of scaling of trees, fat trees, and vertex-diameter graphs using the operations of cloning and gluing are given. The diameter and complexity of the synthesis of such graphs are estimated.
Keywords: trees, fat trees, vertex-diameter graphs, diameter, dominating set with neighborhood, gluing and cloning operations.
Received: 16.02.2023
Document Type: Article
UDC: 519.175.2
Language: Russian
Citation: M. A. Iordanskii, “Scaling Graphs with Diameter Constraint”, Diskr. Mat., 35:4 (2023), 46–57
Citation in format AMSBIB
\Bibitem{Ior23}
\by M.~A.~Iordanskii
\paper Scaling 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}
Linking options:
  • https://www.mathnet.ru/eng/dm1770
  • https://doi.org/10.4213/dm1770
  • https://www.mathnet.ru/eng/dm/v35/i4/p46
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:104
    References:22
    First page:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024