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.
Similar content being viewed by others
References
G. A. Donets and Bin Zhang, “Statement and solution of some problems on a mathematical safe,” Cybernetics and Systems Analysis, No. 3, 3–14 (2006).
H. Hasse, Vorlesungen uber Zahlentheorie [Russian translation], Izd. Inostr. Lit., Moscow (1953).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 14–21, September–October 2006.
Rights and permissions
About this article
Cite this article
Donets, G.A., Zhang, B. Problems on mathematical safes on graphs. Cybern Syst Anal 42, 624–630 (2006). https://doi.org/10.1007/s10559-006-0099-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0099-y