Formulation of Total Shortening Distance for Obtaining an Optimal Level of Adding Short Relations to a Delegate in a Pyramid Organization

Kiyoshi SAWADA


We study models of adding relations between a delegate member and other member of a pyramid organization for the purpose of revealing optimal additional relations. This paper proposes a model of adding edges between a delegate node and every other node of the same depth N in a complete binary tree of height H when adding edges are shorter than those of the complete binary tree. The lengths of adding edges are L (0 < L < 1) while those of edges of the complete binary tree are 1. The total shortening distance to obtain the optimal depth N* which maximizes the total shortening distance is formulated. Furthermore, the total shortening distance of this model is illustrated with numerical examples.


Pyramid organization, Adding relation, Optimal level, Total shortening distance


Full Text: