THE $dr$-OBSERVATION CENTRALITY IN GRAPHS
Far East Journal of Mathematical Sciences (FJMS) · 19.05.2026 · 143 (6) · 1635-1652
DOI: 10.17654/0972087126095 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 19.05.2026. Verfasst von Reymark Agarrado und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Centrality is an important concept in graph theory and network science, identifying the most influential elements within a network. However, traditional measures often overlook how vertices or edges are observed through direct or indirect relationships. This study introduces $dr$-Observation Centrality, a new centrality measure that evaluates how parts of a graph are perceived directly, by selection, or indirectly through connected components. It is analyzed using special graphs and certain graph operations, yielding Nordhaus-Gaddum-type results. The results show a significant influence of observation-based centrality, offering a new perspective on network visibility with applications in communication systems, surveillance, and information flow analysis.
Zitieren
APA
Agarrado, R., Jr., I. C., & Ortega, M. (2026). THE $dr$-OBSERVATION CENTRALITY IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(6), 1635-1652. https://doi.org/10.17654/0972087126095
Vancouver
Agarrado R, Jr. IC, Ortega M. THE $dr$-OBSERVATION CENTRALITY IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(6):1635-1652. doi:10.17654/0972087126095
BibTeX
@article{Agarrado2026,
author = {Agarrado, Reymark and Jr., Isagani Cabahug and Ortega, Marivir},
title = {THE $dr$-OBSERVATION CENTRALITY IN GRAPHS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {6},
pages = {1635--1652},
doi = {10.17654/0972087126095}
}
EUVIMED