Prikladnaya 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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2013, Number 3(21), Pages 76–85 (Mi pdm417)  
This article is cited in 1 scientific paper (total in 1 paper)

Applied Graph Theory

On a construction of quadruple circulant networks with the maximal number of nodes for any diameter

E. A. Monakhova

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Full-text PDF (605 kB) Citations (1)
References:
PDF
HTML
Abstract: For undirected circulant networks, the maximization problem for the number of nodes under given degree and diameter of a graph is considered. A new lower estimate is obtained for the attainable number of nodes in the circulant graphs of dimension 4 and any diameter. Some new infinite families of circulants reaching this estimate are constructed. For graphs of these families, some analytical descriptions are given.
Keywords: undirected circulant graphs, diameter, maximum order of a graph.
Document Type: Article
UDC: 519.87
Language: Russian
Citation: E. A. Monakhova, “On a construction of quadruple circulant networks with the maximal number of nodes for any diameter”, Prikl. Diskr. Mat., 2013, no. 3(21), 76–85
Citation in format AMSBIB
\Bibitem{Mon13}
\by E.~A.~Monakhova
\paper On a~construction of quadruple circulant networks with the maximal number of nodes for any diameter
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 3(21)
\pages 76--85
\mathnet{http://mi.mathnet.ru/pdm417}
Linking options:
  • https://www.mathnet.ru/eng/pdm417
  • https://www.mathnet.ru/eng/pdm/y2013/i3/p76
    • 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
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:153
    Full-text PDF :49
    References:41
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024