Skip to main content

An Optimal Model of Adding Relation Between the Top and a Member of a Linking Pin Organization Structure with K Subordinates

  • Chapter
  • First Online:
IAENG Transactions on Engineering Technologies

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

  • 795 Accesses

Abstract

This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent. When a new edge between the root and a node with a depth N is added, an optimal depth N * is obtained by minimizing the total distance which is the sum of lengths of shortest paths between every pair of all nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Koontz H, O’Donnell C, Weihrich H (1980) Management, 7th edn. McGraw-Hill, New York

    Google Scholar 

  2. Likert R, Likert JG (1976) New ways of managing conflict. McGraw-Hill, New York

    Google Scholar 

  3. Robbins SP (2003) Essentials of organizational behavior, 7th edn. Prentice Hall, Upper Saddle River

    Google Scholar 

  4. Takahara Y, Mesarovic M (2003) Organization structure: cybernetic systems foundation. Kluwer Academic/Plenum Publishers, New York

    MATH  Google Scholar 

  5. 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–1500

    Article  MathSciNet  MATH  Google Scholar 

  6. Sawada K (2008) Adding relations in the same level of a linking pin type organization structure. IAENG Int J Appl Math 38:20–25

    MathSciNet  Google Scholar 

  7. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge

    Google Scholar 

  8. 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. In: Proceedings of the international multiconference of engineers and computer scientists 2012, IMECS 2012. Lecture notes in engineering and computer science. Hong Kong, 14–16 Mar 2012, pp 1598–1601

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kiyoshi Sawada .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Sawada, K., Kawakatsu, H., Mitsuishi, T. (2013). An Optimal Model of Adding Relation Between the Top and a Member of a Linking Pin Organization Structure with K Subordinates. In: Yang, GC., Ao, SI., Huang, X., Castillo, O. (eds) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol 186. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5651-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-5651-9_13

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-5623-6

  • Online ISBN: 978-94-007-5651-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics