The strength of a graph and its application to organizational structure

✍ Scribed by Michael F. Capobianco; John C. Molluzzo

• Publisher: Elsevier Science
• Year: 1979
• Tongue: English
• Weight: 500 KB
• Volume: 2
• Category: Article
• ISSN: 0378-8733
• DOI: 10.1016/0378-8733(79)90018-2

✦ Synopsis

The strength of a point in a graph is defined as the increase in the number of connected components in the graph upon removal of the point. Given an ordering of the points of a graph, the strength vector S of the graph is the vector whose ith component is the strength of the ith point of the graph. An algorithm for computing S is presented. The strength of a graph is then defined and applied to the analysis of simple intra-organization mergers.