Geodesic
Multiplicative circulant networks
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 5, pp. 56-66

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

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