Tree-Like Structure Graphs with Full Diversity of Balls
- 作者: Evdokimov A.1,2, Fedoryaeva T.1,2
-
隶属关系:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- 期: 卷 12, 编号 1 (2018)
- 页面: 19-27
- 栏目: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212971
- DOI: https://doi.org/10.1134/S1990478918010039
- ID: 212971
如何引用文章
详细
Under study is the diversity of metric balls in connected finite ordinary graphs considered as a metric space with the usual shortest-path metric. We investigate the structure of graphs in which all balls of fixed radius i are distinct for each i less than the diameter of the graph. Let us refer to such graphs as graphs with full diversity of balls. For these graphs, we establish some properties connected with the existence of bottlenecks and find out the configuration of blocks in the graph. Using the obtained properties, we describe the tree-like structure graphs with full diversity of balls.
作者简介
A. Evdokimov
Sobolev Institute of Mathematics; Novosibirsk State University
编辑信件的主要联系方式.
Email: evdok@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
T. Fedoryaeva
Sobolev Institute of Mathematics; Novosibirsk State University
Email: evdok@math.nsc.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090