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, 2011, Volume 18, Issue 1, Pages 77–84 (Mi da640)  
This article is cited in 3 scientific papers (total in 3 papers)

On an extremal family of circulant networks

E. A. Monakhova

Institute of Computational Technologies, Novosibirsk, Russia
Full-text PDF (236 kB) Citations (3)
References:
PDF
HTML
Abstract: We consider the problem of maximization of the number of nodes of circulant networks for a given degree and diameter. The estimate of the diameter of graphs of the best known extremal family of circulant networks is improved that together with results given earlier for multiplicative circulant graphs allowed to improve the lower estimates of attainable number of nodes of circulant networks for any dimension $k\ge4$. Bibliogr. 12.
Keywords: circulant network, diameter, maximal order of a graph.
Received: 29.07.2010
Revised: 11.11.2010
English version:
Journal of Applied and Industrial Mathematics, 2011, Volume 5, Issue 4, Pages 595–600
DOI: https://doi.org/10.1134/S1990478911040144
Bibliographic databases:
Document Type: Article
UDC: 519.87
Language: Russian
Citation: E. A. Monakhova, “On an extremal family of circulant networks”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 77–84; J. Appl. Industr. Math., 5:4 (2011), 595–600
Citation in format AMSBIB
\Bibitem{Mon11}
\by E.~A.~Monakhova
\paper On an extremal family of circulant networks
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 1
\pages 77--84
\mathnet{http://mi.mathnet.ru/da640}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2847831}
\zmath{https://zbmath.org/?q=an:1249.90031}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 4
\pages 595--600
\crossref{https://doi.org/10.1134/S1990478911040144}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-82655180511}
Linking options:
  • https://www.mathnet.ru/eng/da640
  • https://www.mathnet.ru/eng/da/v18/i1/p77
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:250
    Full-text PDF :70
    References:45
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024