Yushmanov S V

Publications in Math-Net.Ru

1. Method to find weights which dees not need a full matrix of pairwise comparisons
   
   Avtomat. i Telemekh., 1990, no. 2,  186–189
2. Representations of graphs and networks (coding, layouts and embeddings)
   
   Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 27 (1990),  129–196
3. A general method for evaluating the metric characteristics of a graph that are connected with eccentricity
   
   Dokl. Akad. Nauk SSSR, 306:1 (1989),  52–54
4. Metric properties of chordal and Ptolemaic graphs
   
   Dokl. Akad. Nauk SSSR, 300:2 (1988),  296–299
5. A simple relationship between the diameter and the radius of a graph
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1988, no. 4,  58–60
6. $m$-convexity and the centers of chordal graphs
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1988, no. 1,  78–80
7. Estimates for the metric dimension of a graph in terms of the diameters and the number of vertices
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1987, no. 1,  68–70
8. Graph theory (algorithmic, algebraic, and metric problems)
   
   Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 23 (1985),  68–117
9. Representation of a tree with $p$ hanging vertices by $2p-3$ elements of its distance matrix
   
   Mat. Zametki, 35:6 (1984),  877–887
10. Covering a graph by a system of shortest simple chains
    
    Dokl. Akad. Nauk SSSR, 266:6 (1982),  1303–1305
11. Regeneration of a graph by a certain subset of columns of its distance matrix
    
    Mat. Zametki, 31:4 (1982),  641–651
12. Reconstruction of an arbitrary graph from a certain subset of rows and columns of its distance matrix
    
    Dokl. Akad. Nauk SSSR, 259:1 (1981),  49–52