EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Vertex Betweenness Centrality Of Some Graph Classes With Applications

Shaoli Nandi, Sukumar Mondal, Sambhu Charan Barman

Intelligent Systems Research and Applications Journal · 26.05.2026 · 2 · 252-273

DOI: 10.59543/fwf39211 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Intelligent Systems Research and Applications Journal, online erschienen am 26.05.2026. Verfasst von Shaoli Nandi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Centrality is an excellent concept for measuring the important or critical vertices in graphs like social networks, biological networks, computer networks etc. Every vertex may be an important vertex from an angle depending on our assumption or how we define the importance. There are different centrality measurements to know the vertex characteristics in a network. Betweenness centrality is a crucial measurement for network analysis based on all shortest paths between each pair of vertices. The betweenness centrality of a node point $v$ is the sum of the ratios between the number of the shortest routes between each pair of other node points that pass through $v$ and the total number of the shortest routes between them. This study describes some new theoretical results related with the measurement of betweenness centrality, relative betweenness centrality and graph betweenness centrality of some special graph classes. In addition, we discuss real-life applications of the results studied in this article.

Zitieren

APA

Nandi, S., Mondal, S., & Barman, S. C. (2026). Vertex Betweenness Centrality Of Some Graph Classes With Applications. Intelligent Systems Research and Applications Journal, 2, 252-273. https://doi.org/10.59543/fwf39211

Vancouver

Nandi S, Mondal S, Barman SC. Vertex Betweenness Centrality Of Some Graph Classes With Applications. Intelligent Systems Research and Applications Journal. 2026;2:252-273. doi:10.59543/fwf39211

BibTeX
@article{Nandi2026,
  author = {Nandi, Shaoli and Mondal, Sukumar and Barman, Sambhu Charan},
  title = {Vertex Betweenness Centrality Of Some Graph Classes With Applications},
  journal = {Intelligent Systems Research and Applications Journal},
  year = {2026},
  volume = {2},
  pages = {252--273},
  doi = {10.59543/fwf39211}
}
Kostenlos starten →