Dominating sets in social network graphs
DOI10.1016/0165-4896(88)90041-8zbMath0653.92020OpenAlexW2070698547MaRDI QIDQ1108233
Margaret B. Cozzens, Laura L. Kelleher
Publication date: 1988
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-4896(88)90041-8
cliquestatusstructure of social networksdominating sets of graphsdominating verticesMinimum dominating setsstructurally equivalent set
Graph theory (05C99) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Mathematical sociology (including anthropology) (91D99) Software, source code, etc. for problems pertaining to biology (92-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (17)
Cites Work
- A mathematical analysis of a natural class of partitions of a graph
- Complement reducible graphs
- Parallel concepts in graph theory
- Total domination in graphs
- Towards a theory of domination in graphs
- A Note on "The Comparability Graph of a Tree"
- Dominating cliques in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dominating sets in social network graphs