Geodesic
Optimization of quadruple circulant networks
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 3, pp. 58-64 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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},
     year = {2008},
     volume = {15},
     number = {3},
     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
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
%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/

[1] Monakhov O. G., Monakhova E. A., Parallelnye sistemy s raspredelennoi pamyatyu: struktury i organizatsiya vzaimodeistvii, Izd-vo SO RAN, Novosibirsk, 2000, 242 pp. | Zbl

[2] Bermond J.-C., Comellas F., Hsu D. F., “Distributed loop computer networks: a survey”, J. Parallel Distributed Comput., 24 (1995), 2–10 | DOI

[3] Chen S., Jia X.-D., “Undirected loop networks”, Networks, 23 (1993), 257–260 | DOI | MR | Zbl

[4] Hwang F. K., “A survey on multi-loop networks”, Theoretical Computer Science, 299 (2003), 107–121 | DOI | MR | Zbl

[5] Monakhov O. G., Monakhova E. A., “Computer discovery of analytical descriptions of families of circulant networks”, Proc. of the 6th International conference on soft computing and measurements, SCM'2003, Vol. 1 (St.-Petersburg, Russia, 2003), SPTU, S.-Peterburg, 2003, 345–348

[6] Parhami B., “Chordal rings based on symmetric odd-radix number systems”, Proc. International conference on communications in computing (Las Vegas, NV, June 27–30, 2005), IEEE Press, Los Alamitos, 2005, 196–199

[7] Wong C. K., Coppersmith D., “A combinatorial problem related to multimodule memory organizations”, J. Assoc. Comput. Mach., 21 (1974), 392–402 | MR | Zbl