RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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., 2010, Volume 17, Number 5, Pages 56–66 (Mi da625)  

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

Multiplicative circulant networks

E. A. Monakhova

Institute of Computanional Technologies, Novosibirsk, Russia

Abstract: We consider the problem of maximization of the number of nodes for the given degree and diameter of circulant networks. Study of the class of multiplicative circulant networks in which the chord lengths are the powers of an odd number makes it possible to obtain new improved lower estimates of the number of nodes of circulant networks for any dimension $k\ge4$. The infinite families of circulant networks attaining the found bounds are constructed. Bibliogr. 13.

Keywords: circulant network, diameter, maximal order of a graph.

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

Bibliographic databases:

Document Type: Article
UDC: 519.87
Received: 10.03.2010
Revised: 01.07.2010

Citation: E. A. Monakhova, “Multiplicative circulant networks”, Diskretn. Anal. Issled. Oper., 17:5 (2010), 56–66

Citation in format AMSBIB
\Bibitem{Mon10}
\by E.~A.~Monakhova
\paper Multiplicative circulant networks
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 5
\pages 56--66
\mathnet{http://mi.mathnet.ru/da625}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779352}
\zmath{https://zbmath.org/?q=an:1249.05360}


Linking options:
  • http://mi.mathnet.ru/eng/da625
  • http://mi.mathnet.ru/eng/da/v17/i5/p56

    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, “On an extremal family of circulant networks”, J. Appl. Industr. Math., 5:4 (2011), 595–600  mathnet  crossref  mathscinet  zmath
    2. E. A. Monakhova, “Strukturnye i kommunikativnye svoistva tsirkulyantnykh setei”, PDM, 2011, no. 3(13), 92–115  mathnet
  • Дискретный анализ и исследование операций
    Number of views:
    This page:190
    Full text:53
    References:16
    First page:2

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