graph, algorithm, discrete convolution operator. Graph, algorithm, reachability, random walk, flows i networks
Subject:
Theory of Graphs, operators of convolution type. Ôlgorithms on graphs, operators of local type
Biography
Graduate RSU in 1970 as mathemathian. Scientific advizor — prof. I. B. Simonenko. Cand.Sci. thesis "Multiple discrete convolution tipe operators". Now my narrow speciality iz — the theory of graphs and its applications. List of publications conteins more than 100 titles, such as Mathematics. General course (textbook) (3 ed.), Discrete Mathematics: theory, applications and exersises (8 ed.). Among my pupils are 6 Phd. I have a title professor, Soros honored Professor, Honored worker of higher scholl RF. Dean of the faculty Mathematics, Mechanics and Computer Sciences of the Southern Federal University.
Main publications:
Mathematics. General course (textbook), Sp.-b., Lan', 2006. - 960 pp.
Discrete Mathematics: theory, applications and exersises, M., Vuzovskaia kniga, 2006, 8-th ed., 268 pp.
Nonstandart connectivity on orieted graphs. General approuch/ Izvestia vuzov. Northen Caucasis reg. Special realize. PDO and some problems of mathphiziks, 2005.
I. M. Erusalimskyi, V. A. Skorokhodov, V. A. Rusakov, “Maximum flow in parallel networks with connected arcs”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 231 (2024), 44–52
2023
2.
V. A. Skorokhodov, I. M. Erusalimskyi, H. N. Abdulrahman, “Resource networks with dynamic arc durations”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 226 (2023), 108–119
3.
I. M. Erusalimskyi, M. I. Osipov, V. A. Skorokhodov, “Extreme paths on graphs with simultaneously varying arc durations”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 225 (2023), 69–72
2022
4.
V. A. Skorokhodov, I. M. Erusalimskyi, S. Ch. Murtuzalieva, “The problem of finding the initial state of a resource network”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 209 (2022), 42–52
5.
I. M. Erusalimskyi, V. A. Skorokhodov, V. A. Rusakov, “Flows in networks with barrier reachability”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 208 (2022), 24–28
6.
I. M. Erusalimskyi, M. I. Cherdyntseva, “Combinatorial algorithm for finding the number of paths on a directed graph”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 204 (2022), 37–43
2021
7.
I. M. Erusalimskyi, A. V. Ivantsov, “"${n}$-$1$" paths on lattice graphs. Random walks”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 194 (2021), 107–114
2018
8.
I. M. Erusalimskyi, “2–3 Paths in a Lattice Graph: Random Walks”, Mat. Zametki, 104:3 (2018), 396–406; Math. Notes, 104:3 (2018), 395–403
O. G. Avsyankin, S. N. Askhabov, B. G. Vakulov, V. S. Guliev, I. M. Erusalimskyi, A. N. Karapetyants, G. S. Rostetskaya, A. G. Kusraev, N. G. Samko, S. G. Samko, Kh. G. Umarov, A. F. Chuvenkov, “Salaudin Musaevich Umarkhadzhiev (on the occasion of his 70th birthday)”, Vladikavkaz. Mat. Zh., 25:1 (2023), 141–142
2021
10.
A. V. Abanin, O. G. Avsyankin, V. I. Burenkov, B. G. Vakulov, S. K. Vodopyanov, M. L. Gol'dman, V. S. Guliev, I. M. Erusalimskyi, A. N. Karapetyants, M. I. Karyakin, V. M. Kokilashvili, A. G. Kusraev, E. R. Liflyand, A. V. Pskhu, V. S. Rabinovich, S. V. Rogozin, B. S. Rubin, A. P. Soldatov, I. M. Spitkovsky, V. D. Stepanov, Kh. G. Umarov, S. M. Umarkhadzhiev, “Stefan Grigorievich Samko (on the occasion of his 80th birthday)”, Vladikavkaz. Mat. Zh., 23:3 (2021), 126–129
2011
11.
O. G. Avsyankin, B. G. Vakulov, I. M. Erusalimskyi, A. N. Karapetyants, M. I. Karyakin, A. G. Kusraev, “Stefan Grigog'evich Samko (on his seventieth birthday)”, Vladikavkaz. Mat. Zh., 13:2 (2011), 67–68
Contact us: