|
Research Article
Identifying key nodes in directed networks using m-rankingShibu Manuel* Department of Mathematics, St. Dominic’s College Kanjirapally, Kerala, India * Corresponding Author. Email: [email protected] ARTICLE INFO Journal: International Journal of Advances in Applied Mathematics and Mechanics (IJAAMM) Volume: 13 | Issue: 4 | Pages: 16–21 Issue date: June 2026 License: Open Access (CC BY-NC-ND 3.0) DOI: 10.26541/ijaamm.2026.130402 ARTICLE HISTORY Received: 8 January 2026 Revised: 3 March 2026 Accepted: 10 March 2026 Published online: March 2026 AbstractDirected networks are highly important for studying the dynamics of information spread, as the flow takes place from a source to where information is absent. This work extends the m-Ranking method to directed networks, creating a novel procedure for identifying important nodes by considering the relative significance of all nodes and all directed edges. The total power, T(i), for a node is calculated using a formula that incorporates both the outward degree of the node and the weights of all outgoing edges. KeywordsGraphs • Networks • Centrality Measures • m-Ranking of Nodes MSC (2020)68Q99 • 94C15 How to CiteManuel, S. (2026). Identifying key nodes in directed networks using m-ranking. International Journal of Advances in Applied Mathematics and Mechanics, 13(4), 16–21. https://doi.org/10.26541/ijaamm.2026.130402 © 2026 The Author(s). This article is distributed under the Creative Commons Attribution NonCommercial NoDerivatives License. |
Indexing
Vertical Divider
|