Algebraic operations on graphs preserving the degree sequence
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2009), pp. 48-50
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.
@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},
publisher = {mathdoc},
number = {5},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2009_5_a8/}
}
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/