|
|
|
Publications in Math-Net.Ru |
Citations |
|
2010 |
| 1. |
D. L. Belotserkovskii, “On the problem of enumeration of generating graphs with specified diameter”, Probl. Upr., 2010, no. 1, 2–6  |
|
1998 |
| 2. |
D. L. Belotserkovskii, “On a problem of the enumeration of extremal graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 3–27   |
2
|
|
1997 |
| 3. |
D. L. Belotserkovskii, V. M. Vishnevskii, “A New Algorithm of Generating Spanning Doubly-Connected Subgraphs for Topology Optimization of Data Networks”, Avtomat. i Telemekh., 1997, no. 1, 108–120 ; Autom. Remote Control, 58:1 (1997), 88–97 |
2
|
| 4. |
D. L. Belotserkovskii, “Characterization of some extremal graphs with a diameter at most three”, Diskr. Mat., 9:1 (1997), 134–146 ; Discrete Math. Appl., 7:2 (1997), 163–176 |
1
|
|
| Organisations |
|
|
Contact us: