Geodesic
Optimization of quadruple circulant networks
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 3, pp. 58-64

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2008_15_3_a5,
     author = {\`E. A. Monakhova},
     title = {Optimization of quadruple circulant networks},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {58--64},
     publisher = {mathdoc},
     volume = {15},
     number = {3},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_3_a5/}
}
TY  - JOUR
AU  - È. A. Monakhova
TI  - Optimization of quadruple circulant networks
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 58
EP  - 64
VL  - 15
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_3_a5/
LA  - ru
ID  - DA_2008_15_3_a5
ER  - 
%0 Journal Article
%A È. A. Monakhova
%T Optimization of quadruple circulant networks
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 58-64
%V 15
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_3_a5/
%G ru
%F DA_2008_15_3_a5
È. A. Monakhova. Optimization of quadruple circulant networks. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 3, pp. 58-64. http://geodesic.mathdoc.fr/item/DA_2008_15_3_a5/