An Optimal Model of Adding Relation Between the Top and a Member of a Linking Pin Organization Structure with K Subordinates

摘要

This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete k-ary tree of height H is adjacent. When a new edge between the root and a node with a depth N is added, an optimal depth N~* is obtained by minimizing the total distance which is the sum of lengths of shortest paths between every pair of all nodes.