Tree-like structure graphs with full diversity of balls
Keywords:
graph, tree-like structure graphs, metric ball, radius of a ball, number of balls, diversity vector of balls, full diversity of ballsAbstract
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.
Illustr. 8, bibliogr. 22
Downloads
Download data is not yet available.
Downloads
Published
2019-10-01
How to Cite
[1]
Евдокимов, А.А. and Федоряева, Т.И. 2019. Tree-like structure graphs with full diversity of balls. Discrete analysis and operations research. 25, 1 (Oct. 2019), 25–41.
Issue
Section
Articles