Affiliations: [a]
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, India
| [b]
Department of Mathematics, Tamralipta Mahavidyalaya, Tamluk, West Bengal, India
| [c]
Research Center of Performance and Productivity Analysis, Istinye University, Istanbul, Turkiye
Correspondence:
[*]
Corresponding author. Sovan Samanta, Department of Mathematics, Tamralipta Mahavidyalaya, Tamluk, West Bengal - 721636, India. E-mail: [email protected].
Abstract: The most critical task of a social network is to identify a central node. Numerous methods for determining centrality are documented in the literature. It contributes to online commerce by disseminating news, advertisements and other content via central nodes. Existing methods capture the node’s direct reachability. This study introduces a novel method for quantifying centrality in a fuzzy environment. This measurement takes into account the reachability of nodes and their direct connections. Several critical properties have been demonstrated. A small Facebook network is used to illustrate the issue. Additionally, appropriate tables and graphs present a comparative study with existing methods for centrality measurement.
Keywords: Fuzzy graph, social network, centrality measure
