Placing a liaison with long communication lengths to the same level in an organization structure

This study proposes a model of placing a liaison which forms relations to all members in the same level of a pyramid organization structure such that the communication of information between every member in the organization becomes the most efficient. This model considers that lengths between the liaison and the other members are more than those between members except the liaison in the organization. When an added node of liaison gets adjacent to all nodes with the same depth TV in a complete binary tree of height H where the lengths of edges between the liaison and the other members are L(l <; L <; 2) while those of edges between members except the liaison are 1, we obtained an optimal depth N* = H which maximizes the total shortening distance which is the sum of shortening lengths of shortest paths between every pair of all nodes in a complete binary tree.