Email this article Tree-Like Structure Graphs with Full Diversity of Balls
- Authors: Evdokimov A.A.1,2, Fedoryaeva T.I.1,2
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Issue: Vol 12, No 1 (2018)
- Pages: 19-27
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212971
- DOI: https://doi.org/10.1134/S1990478918010039
- ID: 212971
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. A. Evdokimov
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: evdok@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
T. I. Fedoryaeva
Sobolev Institute of Mathematics; Novosibirsk State University
Email: evdok@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
