Algebraic Operations on Graphs Preserving the Degree Sequence / M.I. Lasheva // Vestn. Mosk. Univ., Matem. Mekhan. 2009. № 5. P. 48-50 [Moscow Univ. Math. Bulletin. Vol. 64, No 5, 2009. P. 209-210]
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.
Key words: degree sequence, finite state automaton.