AN EXTENSION OF REGULAR COLORING OF GRAPHS TO DIGRAPHS, NETWORKS AND HYPERGRAPHS

被引:13
作者
EVERETT, MG [1 ]
BORGATTI, SP [1 ]
机构
[1] UNIV S CAROLINA,COLUMBIA,SC 29208
关键词
D O I
10.1016/0378-8733(93)90007-8
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
The use of regular graph colouring as an equivalent simple definition for regular equivalence is extended from graphs to digraphs and networks. In addition new concepts of regular equivalence for edges and hypergraphs are presented using the new terminology.
引用
收藏
页码:237 / 254
页数:18
相关论文
共 7 条
[1]  
BORGATTI SP, 1989, THESIS U CALIFORNIA
[2]  
Davis Allison, 1941, DEEP S SOCIAL ANTHR
[3]   MEASURING REGULAR EQUIVALENCE IN SYMMETRICAL STRUCTURES [J].
DOREIAN, P .
SOCIAL NETWORKS, 1987, 9 (02) :89-107
[4]   ROLE COLORING A GRAPH [J].
EVERETT, MG ;
BORGATTI, S .
MATHEMATICAL SOCIAL SCIENCES, 1991, 21 (02) :183-188
[5]  
REITZ KP, 1989, RES METHODS SOCIAL N
[6]   STRUCTURES INDUCED BY COLLECTIONS OF SUBSETS - A HYPERGRAPH APPROACH [J].
SEIDMAN, SB .
MATHEMATICAL SOCIAL SCIENCES, 1981, 1 (04) :381-396
[7]   GRAPH AND SEMIGROUP HOMOMORPHISMS ON NETWORKS OF RELATIONS [J].
WHITE, DR ;
REITZ, KP .
SOCIAL NETWORKS, 1983, 5 (02) :193-234