Placing a liaison with long communication lengths between two members in an organization structure

This study proposes a model of placing a liaison which forms relations with long communication lengths to two 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. When an added node of liaison gets adjacent to two nodes with the same depth N in a complete K-ary tree of height H where the lengths of edges between the liaison and the other members are L (1 <; L <; 2) while those of edges between members except the liaison are 1, the total shortening distance which is the sum of shortening lengths of shortest paths between every pair of all nodes in the complete K-ary tree is formulated to obtain an optimal pair of two members to which the liaison forms relations.