Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 4, Pages 47–60 (Mi da579)  
This article is cited in 1 scientific paper (total in 1 paper)

Optimal generalized Petersen graphs

E. A. Monakhova

Institute of Computational Mathematics and Mathematical Geophysics, SB RAS, Novosibirsk, Russia
Full-text PDF (283 kB) Citations (1)
References:
PDF
HTML
Abstract: The generalized Petersen graphs are considered as a model for interconnection networks of computer systems. We consider the problem of minimization of the diameter (the maximal delay in a network) for a given number of nodes of a graph. A mapping of optimal circulant networks of degree four into the class of generalized Petersen graphs is found which preserves the optimality of a graph. Analytical descriptions of optimal generalized Petersen graphs are given for any order of a graph. An analytical solution of a problem of the shortest paths routing is presented for the obtained optimal graphs. Il. 2, tabl. 1, bibl. 24.
Keywords: generalized Petersen graphs, circulant graphs of degree four, diameter, optimal graphs, shortest paths.
Received: 26.01.2009
Revised: 30.04.2009
Bibliographic databases:
UDC: 519.176
Language: Russian
Citation: E. A. Monakhova, “Optimal generalized Petersen graphs”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 47–60
Citation in format AMSBIB
\Bibitem{Mon09}
\by E.~A.~Monakhova
\paper Optimal generalized Petersen graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 4
\pages 47--60
\mathnet{http://mi.mathnet.ru/da579}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2589401}
\zmath{https://zbmath.org/?q=an:1249.05328}
Linking options:
  • https://www.mathnet.ru/eng/da579
  • https://www.mathnet.ru/eng/da/v16/i4/p47
    • 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