Speciality:
01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail: ,
Keywords: graphs, diameter, diametral vertices, central vertices, center, almost all graphs, typical graphs, metric ball and sphere, number of balls, diversity vector of balls
UDC: 519.1, 519.17, 519.7, 519.173, 519.176, 519.178
Subject:
graphs, metric properties of graphs,
typical graphs, typical properties of graphs, combinatorics, combinatorial analysis
Main publications:
T. I. Fedoryaeva, “Center and its spectrum of almost all n-vertex graphs of given diameter”, Siberian Electronic Mathematical Reports, 2021, 511-529
T. I. Fedoryaeva, “Asymptotic approximation for the number of n-vertex graphs of given diameter”, Journal of Applied and Industrial Mathematics, 11:2 (2017), 204-211
T. I. Fedoryaeva, “Structure of the diversity vector of balls of a typical graph with given diameter”, Sib. Electr. Math. Reports, 13 (2016), 375–387.
T. I. Fedoryaeva, “Majorants and minorants for the classes of graphs with fixed diameter and number of vertices”, Journal of Applied and Industrial Mathematics, 7:2 (2013), 153-165
T. I. Fedoryaeva, "Combinatorial algorithms", Novosibirsk, 2011, ISBN: 978-5-4437-0019-9 , 118 pp.
T. I. Fedoryaeva, “Exact upper estimates of the number of different balls of given radius for the graphs with fixed number of vertexes and diameter”, Diskret. Analysis and Oper. Reseach, 16:6 (2009), 74–92.
T. I. Fedoryaeva, “Diversity vectors of balls in graphs and estimates of the components of the vectors”, Journal of Applied and Industrial Mathematics, 2:3 (2008), 341–356.
T. I. Fedoryaeva, “Variety of balls in metric spaces of trees”, Diskret. Analysis and Oper. Reseach, 12:3 (2005), 74–84.
T. I. Fedoryaeva, “Outerplanar graphs with the metric continuation property. I, II”, Diskret. Analysis and Oper. Reseach, 7:1 (2000), 83–112; Diskret. Analysis and Oper. Reseach, 8:1 (2001), 88–112.
