SEMIRINGS FOR SOCIAL NETWORKS ANALYSIS

被引:23
作者
BATAGELJ, V
机构
[1] Department of Mathematics, University of Ljubljana
关键词
BALANCED SIGNED GRAPHS; CLUSTERABLE SIGNED GRAPHS; CLOSED SEMIRINGS; CLOSURE; GEODESIC; FREEMANS CENTRALITY INDEXES; BOYLES OPERATION;
D O I
10.1080/0022250X.1994.9990135
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In the paper four semirings for solving social networks problems are constructed. The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length and the number of u - v geodesics; and for geodetic semiring the length and the set of vertices on u - v geodesics. The algorithms for computing the geodetic and the geodetic closure matrix are also given.
引用
收藏
页码:53 / 68
页数:16
相关论文
共 22 条
[1]  
Aho A., 1976, DESIGN ANAL COMPUTER
[2]  
[Anonymous], 1976, DISCRETE MATH MODELS
[3]  
BATAGELJ V, 1990, UNPUB SIGNED GRAPHS
[4]  
BATAGELJ V, 1993, UNPUB USE MATH VERIF
[5]  
BOLE R, 1969, SOCIOMETRY, V32, P91
[6]  
BURKARD RE, 1984, ANN DISCRETE MATH, V19
[7]  
Carre B., 1979, GRAPHS NETWORKS
[8]  
Cartwright D., 1968, ELEM MATH, V23, P85
[9]  
Cartwright D, 1979, PERSPECTIVES SOCIAL, P25
[10]  
Chartrand G, 1987, INTRO GRAPH THEORY, V94