Problems on mathematical safes on graphs |
| |
| Authors: | G A Donets Bin Zhang |
| |
| Affiliation: | (1) Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;(2) National Technical University “Kiev Polytechnic Institute,”, Kiev, Ukraine |
| |
| Abstract: | For given two sets of locks, the corresponding problems on mathematical safes are formulated on graphs. In the first set,
all the locks have the same number of sates and, in the second set, any pair of locks can consist of different numbers of
sates. A number of conditions are obtained under which there exist solutions to these problems for safes specified on directed
or undirected single graphs such as a path, a chain, a cycle, and a star.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 14–21, September–October 2006. |
| |
| Keywords: | mathematical safe set of locks state vector of a safe dependency matrix of locks solution of a system of congruences final state of a safe graph residue class |
| 本文献已被 SpringerLink 等数据库收录！ |
|
