Publications in Math-Net.Ru
-
Determining vulnerability of central networks using closeness and Nordhaus–Gaddum type relation
Mat. Zametki, 116:4 (2024), 614–626
-
A Vulnerability Parameter of Networks
Mat. Zametki, 109:4 (2021), 517–526
-
Porous Exponential Domination in Harary Graphs
Mat. Zametki, 107:2 (2020), 231–237
-
On The Bondage Number of Middle Graphs
Mat. Zametki, 93:6 (2013), 803–811
-
Calculation of the Accessibility Number and the Neighbor Integrity of a Graph
Mat. Zametki, 78:5 (2005), 676–686
-
Integrity of Total Graphs via Certain Parameters
Mat. Zametki, 76:5 (2004), 714–722
© , 2026