|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 3, Pages 58–64
(Mi da534)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Optimization of quadruple circulant networks
È. A. Monakhova Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
The problem of maximization of the number of nodes for a fixed degree and diameter for circulant networks is considered. The known lower bound for the maximum order of quadruple circulant networks is improved by $O(\frac32d^3)$ for any odd diameter $d>1$. A family of circulant networks is found at which the obtained estimate is attained. Tabl. 1, bibl. 7.
Keywords:
circulant networks, diameter, the maximum order of a graph.
Received: 14.02.2008 Revised: 05.05.2008
Citation:
È. A. Monakhova, “Optimization of quadruple circulant networks”, Diskretn. Anal. Issled. Oper., 15:3 (2008), 58–64
Linking options:
https://www.mathnet.ru/eng/da534 https://www.mathnet.ru/eng/da/v15/i3/p58
|
Statistics & downloads: |
Abstract page: | 448 | Full-text PDF : | 90 | References: | 55 | First page: | 1 |
|