Abstract
The problem on a mathematical safe is formulated and studied in terms of graph theory. The cases of simplest digraphs such as paths, contours, and doubly connected components are analyzed. A number of statements on the existence of solutions to these problems are proved. The results obtained are extended to the case of corresponding nondirected graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
