How hard is it to determine if a graph has a 2-role assignment?

Networks

Volumn 37, Issue 2, 2001, Pages 67-73

  Roberts, Fred S ^a   Sheng, Li ^b  

^a RUTGERS UNIVERSITY   (United States)

^b DREXEL UNIVERSITY   (United States)

Author keywords

NP completeness; Role assignment; Role coloring; Social networks; Social role

Indexed keywords

EID: 0035285791     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9     Document Type: Article

References (10)

1. [1] S.A. Cook, The complexity of theorem-proving procedures, Proc 3rd Ann ACM Symp on Theory of Computing, Association for Computing Machinery, New York, 1971, pp. 151-158.
2. [2] M.G. Everett and S. Borgatti, Role coloring a graph, Math Soc Sci 21 (1991), 183-188.
3. [3] M.G. Everett and S. Borgatti, Regular equivalence: General theory, J Math Soc 19 (1994), 29-52.
4. [4] M.R. Garey and D.S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
5. [5] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
6. [6] F.S. Roberts, Applied combinatorics, Prentice-Hall, Englewood Cliffs, NJ, 1984.
7. [7] F.S. Roberts, "Role assignments and indifference graphs," Recent progress in mathematical psychology, C.E. Dowling, F.S. Roberts, and P. Theuns (Editors), Lawrence Erlbaum Associates, Mahwah, NJ, 1998, pp. 33-46.
8. [8] F.S. Roberts and L. Sheng, Role assignments, in Combinatorics, graph theory, and algorithms, Y. Alavi, D. Lick, and A. Schwenk (Editors), New Issues Press, Kalamazoo, MI, 1999, Vol. II, pp. 729-745.
9. [9] L.D. Sailer, Structural equivalence: Meaning and definition, computation and application, Social Networks 1 (1978), 73-90.
10. [10] D.R. White and K.P. Reitz, Graph and semigroup homo-morphisms on networks of relations, Social Networks 5 (1983), 193-234.