No abstract

The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of trails satisfying some local restrictions. Algotithm of allowed Eulerian cycle construction is considered. The authors showed that it is possible to recognize the system of transitions and solve the problem of constructing the allowable path by linear time. It's also possible to find allowable Eulerian cycle for Eulerian graph or to proclaim that such a cycle does not exist by the time

Transient processes of a synchronous machine operating on a load with a delta connection circuit are considered. A method is proposed for numerical simulation of transient processes of a synchronous machine with the possibility of taking into account the asymmetry of the stator winding. The model was verified by comparing the results of the calculation of generator transients with an asymmetrical stator winding, obtained using the developed model and using the MATLAB Simulink tools.

No abstract