A generalization of the importance of vertices for an undirected weighted graph

Ronald Manríquez, Camilo Guerrero-Nancuante, Felipe Martínez, Carla Taramasco

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Establishing a node importance ranking is a problem that has attracted the attention of many researchers in recent decades. For unweighted networks where the edges do not have any attached weight, many proposals have been presented, considering local or global information of the networks. On the contrary, it occurs in undirected edge-weighted networks, where the proposals to address this problem have been more scarce. In this paper, a ranking method of node importance for undirected and edge-weighted is provided, generalizing the measure of line importance (DIL) based on the centrality degree proposed by Opsahl. The experimentation was done on five real networks and the results illustrate the benefits of our proposal.

Original languageEnglish
Article number902
JournalSymmetry
Volume13
Issue number5
DOIs
Publication statusPublished - May 2021

Keywords

  • Complex networks
  • Edge-weighted graph
  • Vertex importance

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Chemistry (miscellaneous)
  • Mathematics(all)
  • Physics and Astronomy (miscellaneous)

Fingerprint

Dive into the research topics of 'A generalization of the importance of vertices for an undirected weighted graph'. Together they form a unique fingerprint.

Cite this