Abstract
This paper presents an approach to the study of the structure of social networks using dominating sets of graphs. A method is presented for partitioning the vertices of a graph using dominating vertices. For certain classes of graphs this is helpful in determining the underlying structure of the corresponding social network. An extension of this technique provides a method of studying the structure of directed graphs and directed social networks. Minimum dominating sets are related to statuses and structurally equivalent sets.
Original language | English (US) |
---|---|
Pages (from-to) | 267-279 |
Number of pages | 13 |
Journal | Mathematical social sciences |
Volume | 16 |
Issue number | 3 |
DOIs | |
State | Published - Jan 1 1988 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Sociology and Political Science
- Social Sciences(all)
- Psychology(all)
- Statistics, Probability and Uncertainty
Keywords
- graph
- social networks