Malatya Centrality based Algorithm for Positive Influence Dominating Set

Key Points

• The research aims to develop an algorithm to identify dominating sets in social networks that can effectively influence connections.
• Developed the Malatya Positive Influence Algorithm to create dominating sets.
• Modelled social networks as graphs to represent influences between nodes.
• Analyzed the algorithm's performance on various graph structures.
• The algorithm ensures that at least half of the neighbors of each node are included in the dominating set.
• Demonstrated effective results for specific graph examples, highlighting its utility in social network analysis.

Abstract