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

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


Diskretn. Anal. Issled. Oper., 2013, Volume 20, Number 1, Pages 37–44 (Mi da717)  

This article is cited in 2 scientific papers (total in 2 papers)

A new attainable lower bound on the number of nodes in quadruple circulant networks

E. A. Monakhova

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia

Abstract: We consider the problem of maximization of the number of nodes for fixed degree and diameter of undirected circulant networks. The known lower bound on the maximum order of quadruple circulant networks is improved by $O(d^3)$ for any even diameter $d\equiv0\pmod4$. The family of circulant networks achieving the obtained estimate is found. As we conjecture, the found graphs are the largest circulants for the dimension four. Tab. 2, bibliogr. 9.

Keywords: undirected circulant network, diameter, maximum order of a graph.

Full text: PDF file (244 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.87
Received: 23.04.2012
Revised: 21.09.2012

Citation: E. A. Monakhova, “A new attainable lower bound on the number of nodes in quadruple circulant networks”, Diskretn. Anal. Issled. Oper., 20:1 (2013), 37–44

Citation in format AMSBIB
\Bibitem{Mon13}
\by E.~A.~Monakhova
\paper A new attainable lower bound on the number of nodes in quadruple circulant networks
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 1
\pages 37--44
\mathnet{http://mi.mathnet.ru/da717}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3088147}


Linking options:
  • http://mi.mathnet.ru/eng/da717
  • http://mi.mathnet.ru/eng/da/v20/i1/p37

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. A. Monakhova, “O postroenii tsirkulyantnykh setei razmernosti chetyre s maksimalnym chislom vershin pri lyubom diametre”, PDM, 2013, no. 3(21), 76–85  mathnet
    2. E. A. Monakhova, O. G. Monakhov, “Poisk rekordnykh tsirkulyantnykh grafov s ispolzovaniem parallelnogo geneticheskogo algoritma”, Diskretn. analiz i issled. oper., 22:6 (2015), 29–42  mathnet  crossref  mathscinet  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:201
    Full text:61
    References:44
    First page:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020