Dominating sets in social network graphs

Laura L. Kelleher, Margaret B. Cozzens

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

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 languageEnglish (US)
Pages (from-to)267-279
Number of pages13
JournalMathematical social sciences
Volume16
Issue number3
DOIs
StatePublished - Jan 1 1988
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Sociology and Political Science
  • Social Sciences(all)
  • Psychology(all)
  • Statistics, Probability and Uncertainty

Keywords

  • graph
  • social networks

Fingerprint Dive into the research topics of 'Dominating sets in social network graphs'. Together they form a unique fingerprint.

Cite this