Dominating sets in social network graphs
DOI10.1016/0165-4896(88)90041-8zbMATH Open0653.92020OpenAlexW2070698547MaRDI QIDQ1108233FDOQ1108233
Authors: Laura L. Kelleher, M. Cozzens 
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
Recommendations
cliquestatusstructure of social networksdominating sets of graphsdominating verticesMinimum dominating setsstructurally equivalent set
Directed graphs (digraphs), tournaments (05C20) Mathematical sociology (including anthropology) (91D99) Software, source code, etc. for problems pertaining to biology (92-04) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- Title not available (Why is that?)
- Complement reducible graphs
- Total domination in graphs
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Dominating cliques in graphs
- A Note on "The Comparability Graph of a Tree"
- Title not available (Why is that?)
- A mathematical analysis of a natural class of partitions of a graph
Cited In (32)
- Bounds on the domination number and the metric dimension of co-normal product of graphs
- Semicomplete absorbent sets in digraphs
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Graph profile realizations and applications to social networks
- New results on connected dominating structures in graphs
- Social leaders in graphs
- Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
- Graph signatures: identification and optimization
- Algorithms for dominating clique problems
- Independent rainbow domination of graphs
- Dominating cliques in graphs
- New dominating sets in social networks
- Structural search and optimization in social networks
- THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM
- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
- Algorithms and Models for the Web-Graph
- On rainbow domination numbers of graphs
- Near-optimal dominating sets via random sampling
- Computing an effective decision making group of a society using social network analysis
- Construction and estimation of dominating sets in communication structures
- Dominating cliques in graphs
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- A polynomial-time approximation to a minimum dominating set in a graph
- Dominating complex networks by identifying minimum skeletons
- An Application of Arc-Reaching Sets in Social-Network Analysis
- Structural consequences of individual position in nondyadic social networks
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Vertex-Pursuit in Hierarchical Social Networks
- On the total Roman domination in trees
- Domination on hyperbolic graphs
- On positive influence dominating sets in social networks
- Uncertain weighted dominating set: a prototype application on natural disaster relief management
This page was built for publication: Dominating sets in social network graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108233)
