Geodesic
Optimal generalized Petersen graphs
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 4, pp. 47-60

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

The generalized Petersen graphs are considered as a model for interconnection networks of computer systems. We consider the problem of minimization of the diameter (the maximal delay in a network) for a given number of nodes of a graph. A mapping of optimal circulant networks of degree four into the class of generalized Petersen graphs is found which preserves the optimality of a graph. Analytical descriptions of optimal generalized Petersen graphs are given for any order of a graph. An analytical solution of a problem of the shortest paths routing is presented for the obtained optimal graphs. Il. 2, tabl. 1, bibl. 24.
Keywords: generalized Petersen graphs, circulant graphs of degree four, diameter, optimal graphs, shortest paths. 
@article{DA_2009_16_4_a3,
     author = {E. A. Monakhova},
     title = {Optimal generalized {Petersen} graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {47--60},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_4_a3/}
}
TY  - JOUR
AU  - E. A. Monakhova
TI  - Optimal generalized Petersen graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 47
EP  - 60
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_4_a3/
LA  - ru
ID  - DA_2009_16_4_a3
ER  - 
%0 Journal Article
%A E. A. Monakhova
%T Optimal generalized Petersen graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 47-60
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_4_a3/
%G ru
%F DA_2009_16_4_a3
E. A. Monakhova. Optimal generalized Petersen graphs. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 4, pp. 47-60. http://geodesic.mathdoc.fr/item/DA_2009_16_4_a3/