Geodesic
On an extremal family of circulant networks
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 77-84

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

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