A Model of Adding Relations in the Same Level to an Organization Structure of a Complete K-ary Tree

Abstract

This paper proposes a model of adding relations to an organization structure which is a complete K-ary tree of height H. When edges between every pair of P(P=2,3,...,K) nodes with the same depth N are added, an optimal depth N^* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes.