THE STRENGTH OF A GRAPH AND ITS APPLICATION TO ORGANIZATIONAL-STRUCTURE

被引:3
作者
CAPOBIANCO, MF
MOLLUZZO, JC
机构
[1] St John's University, Staten Island
关键词
D O I
10.1016/0378-8733(79)90018-2
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
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. © 1979.
引用
收藏
页码:275 / 283
页数:9
相关论文
共 3 条
[1]  
Behzad M., 1971, INTRO THEORY GRAPHS
[2]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[3]  
NIEVERGELT J, 1974, COMPUTER APPROACHES