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

Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 229)


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\).


Communication efficiency Complete binary tree Linking pin Organization structure Shortest path Total distance 


  1. 1.
    Likert R, Likert JG (1976) New ways of managing conflict. McGraw-Hill, New YorkGoogle Scholar
  2. 2.
    Robbins SP (2003) Essentials of organizational behavior. 7th edn. Prentice Hall, Upper Saddle RiverGoogle Scholar
  3. 3.
    Takahara Y, Mesarovic M (2003) Organization structure: cybernetic systems foundation. Kluwer Academic/Plenum Publishers, New YorkGoogle Scholar
  4. 4.
    Sawada K, Wilson R (2006) Models of adding relations to an organization structure of a complete K-ary tree. Eur J Oper Res 174:1491–1500MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Sawada K (2008) Adding relations in the same level of a linking pin type organization structure. IAENG Int J Appl Math 38:20–25MathSciNetGoogle Scholar
  6. 6.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. 2nd edn. MIT Press, CambridgeGoogle Scholar
  7. 7.
    Sawada K, Kawakatsu H, Mitsuishi T (2012) A model of adding relation between the top and a member of a linking pin organization structure with K subordinates. Lecture notes in engineering and computer science: Proceedings of the international multiConference of engineers and computer scientists 2012, IMECS 2012, Hong Kong, 14–16 March 2012, pp 1598–1601Google Scholar
  8. 8.
    Sawada K (2012) A model of adding relation between two levels of a linking pin organization structure. Lecture notes in engineering and computer science: Proceedings of the world congress on engineering 2012, WCE 2012, London, UK, 4–6 July 2012, pp 76–79Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Policy StudiesUniversity of Marketing and Distribution SciencesKobeJapan

Personalised recommendations