|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
M. A. Iordanski, “Dominant sets with neighborhood for trees”, Model. Anal. Inform. Sist., 32:1 (2025), 32–41  |
|
2024 |
| 2. |
M. A. Iordanskii, “Letter to the Editors”, Diskr. Mat., 36:2 (2024), 144 |
|
2023 |
| 3. |
M. A. Iordanskii, “Scaling of graphs with diameter constraint”, Diskr. Mat., 35:4 (2023), 46–57 ; Discrete Math. Appl., 35:3 (2025), 143–151 |
1
|
|
2022 |
| 4. |
M. A. Iordanskii“.Cloning operations and graph diameter”, Diskr. Mat., 34:2 (2022), 26–31 ; Discrete Math. Appl., 34:4 (2024), 207–210 |
1
|
|
2012 |
| 5. |
M. A. Iordanskii, “A Constructive Classification of Graphs”, Model. Anal. Inform. Sist., 19:4 (2012), 144–153 |
2
|
|
2003 |
| 6. |
M. A. Iordanskii, “The structure and methods of generation of closed classes of graphs”, Diskr. Mat., 15:3 (2003), 105–116   ; Discrete Math. Appl., 13:4 (2003), 405–416 |
3
|
|
1997 |
| 7. |
M. A. Iordanskii, “A functional approach to the representation of graphs”, Dokl. Akad. Nauk, 353:3 (1997), 303–305 |
2
|
|
1996 |
| 8. |
M. A. Iordanskii, “Constructive descriptions of graphs”, Diskretn. Anal. Issled. Oper., 3:4 (1996), 35–63 |
5
|
|
1974 |
| 9. |
M. A. Iordanskii, “Minimal numberings of the vertices of trees”, Dokl. Akad. Nauk SSSR, 218:2 (1974), 272–275 |
|
| Organisations |
|
|
