Jordan centrality

Jordan centrality

Authors

  • Alan Anderson da Silva Pereira UFAL
  • Lucas Hiroshi dos Santos Nakagawa

DOI:

https://doi.org/10.34179/revisem.v10i2.20986

Abstract

In this text, we will define the concept of Jordan centrality for a vertex in a tree. We will then show, using direct combinatorial methods, that this quantity is minimized by at most two distinct vertices. Finally, we will present a theoretical algorithm for finding vertices that minimize Jordan centrality.

Keywords: Centrality; Tree; Centroid; Jordan.

Downloads

Download data is not yet available.

Downloads

Published

2025-11-07

How to Cite

da Silva Pereira, A. A., & dos Santos Nakagawa, L. H. (2025). Jordan centrality. Revista Sergipana De Matemática E Educação Matemática, 10(2), 160–176. https://doi.org/10.34179/revisem.v10i2.20986

Issue

Vol. 10 No. 2 (2025): Revista Sergipana de Matemática e Educação Matemática

Section

Mathematics

License

Copyright (c) 2025 Alan Anderson da Silva Pereira, Hiroshi Nakagawa

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Creative Commons License

All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International (CC-BY 4.0) license. This means that anyone can copy, distribute, remix, adapt, and use the articles for any purpose, including commercial use, as long as proper attribution is provided to the authors and the journal. For more information about this license, visit: https://creativecommons.org/licenses/by/4.0/