Adding Relation Between Two Levels of a Linking Pin Organization Structure Maximizing Communication Efficiency of Information

This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete binary tree of height \(H\) is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth \(M\) and its descendant with a depth \(N\), we formulated the total shortening distance which is the sum of shortening lengths of shortest paths between every pair of all nodes and obtained an optimal depth \(N^{*}\) which maximizes the total shortening distance for each value of \(M\).