Dominating sets in social network graphs

DOI10.1016/0165-4896(88)90041-8MaRDI QIDQ1108233zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cliquestatusstructure of social networksdominating sets of graphsdominating verticesMinimum dominating setsstructurally equivalent set

Mathematics Subject Classification ID

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)

Recommendations

• New dominating sets in social networks
• Algorithms and Models for the Web-Graph
• A note on non-dominating set partitions in graphs
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• On positive influence dominating sets in social networks

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3873384 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• A Note on "The Comparability Graph of a Tree"
• A mathematical analysis of a natural class of partitions of a graph
• Complement reducible graphs
• Dominating cliques in graphs
• Parallel concepts in graph theory
• Total domination in graphs
• Towards a theory of domination in graphs

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
• Graph signatures: identification and optimization
• Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
• 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
• On rainbow domination numbers of graphs
• Algorithms and Models for the Web-Graph
• 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
• Dominating complex networks by identifying minimum skeletons
• A polynomial-time approximation to a minimum dominating set in a graph
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• Structural consequences of individual position in nondyadic social networks
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• An Application of Arc-Reaching Sets in Social-Network Analysis
• On the total Roman domination in trees
• On positive influence dominating sets in social networks
• Vertex-Pursuit in Hierarchical Social Networks
• Domination on hyperbolic graphs
• 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)