The variation of the sum of edge lengths in linear arrangements of trees

06/24/2020
by   Ramon Ferrer-i-Cancho, et al.
0

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the variation of the physical distance in linear arrangements of the vertices of trees. In particular, we investigate various problems on the sum of edge lengths in trees of a fixed size: the minimum and the maximum value of the sum for specific trees, the minimum and the maximum in classes of trees (bistar trees and caterpillar trees) and finally the minimum and the maximum for any tree. We establish some foundations for research on optimality scores for spatial networks in one dimension.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2020

On extremal leaf status and internal status of trees

For a vertex u of a tree T, the leaf (internal, respectively) status of ...
research
06/06/2022

Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths

A sum-rank-metric code attaining the Singleton bound is called maximum s...
research
01/06/2020

Codes over Trees

In graph theory, a tree is one of the more popular families of graphs wi...
research
06/14/2022

The Maximum Linear Arrangement Problem for trees under projectivity and planarity

The Maximum Linear Arrangement problem (MaxLA) consists of finding a map...
research
10/09/2019

Edge crossings in random linear arrangements

In spatial networks, vertices are arranged in some space and edges may c...
research
08/16/2023

The maximum four point condition matrix of a tree

The Four point condition (4PC henceforth) is a well known condition cha...
research
12/19/2017

The cavity approach for Steiner trees Packing problems

The Belief Propagation approximation, or cavity method, has been recentl...

Please sign up or login with your details

Forgot password? Click here to reset