Geodesic
Algebraic operations on graphs preserving the degree sequence
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2009), pp. 48-50 
M. I. Lasheva. Algebraic operations on graphs preserving the degree sequence. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2009), pp. 48-50. http://geodesic.mathdoc.fr/item/VMUMM_2009_5_a8/
@article{VMUMM_2009_5_a8,
     author = {M. I. Lasheva},
     title = {Algebraic operations on graphs preserving the degree sequence},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {48--50},
     year = {2009},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2009_5_a8/}
}
TY  - JOUR
AU  - M. I. Lasheva
TI  - Algebraic operations on graphs preserving the degree sequence
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2009
SP  - 48
EP  - 50
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2009_5_a8/
LA  - ru
ID  - VMUMM_2009_5_a8
ER  - 
%0 Journal Article
%A M. I. Lasheva
%T Algebraic operations on graphs preserving the degree sequence
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2009
%P 48-50
%N 5
%U http://geodesic.mathdoc.fr/item/VMUMM_2009_5_a8/
%G ru
%F VMUMM_2009_5_a8

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

A finite state automaton implementation of the algorithm of a transformation from a given graph to another one with keeping a degree sequence is considered. The algorithm studied here may be used for optimization of computer networks with a given set of providers and restrictions posed on their communication capability. In this case it is sufficient to know only local characteristics of a netwok, but not global ones as it is required in the algorithm of V. Gavel and S. Hakimi.