Oztemiz, FurkanYakut, Selman2026-04-042026-04-042024979-8-3503-8897-8979-8-3503-8896-12165-0608https://doi.org/10.1109/SIU61531.2024.10601155https://hdl.handle.net/11616/10912632nd IEEE Signal Processing and Communications Applications Conference (SIU) -- MAY 15-18, 2024 -- Tarsus Univ Campus, Mersin, TURKEYCentrality is a frequently used metric in graph theory that identifies the dominance values of nodes. In this study, the Malatya Centrality Algorithm, which approaches graph centrality from a new perspective, has been proposed. To calculate the centrality of a node in the graph, the ratio of the node's degree to the degrees of its neighboring nodes was computed and these ratios were summed. The results of the proposed algorithm were compared with established centrality algorithms in the literature and tested on well-known social networks such as Zachary's karate club, the dolphin social network, and the zebra network. The tests and analyses conducted demonstrate that the Malatya Centrality Algorithm is an effective and successful centrality algorithm.eninfo:eu-repo/semantics/closedAccessBetweennessClosenessEigenvectorMalatya CentralityMalatya Centrality AlgorithmPagerankConference Object10.1109/SIU61531.2024.106011552-s2.0-85200896068N/AWOS:001297894700341N/A