Determining Vulnerability of Central Networks Using Closeness and Nordhaus-Gaddum Type Relation
Küçük Resim Yok
Tarih
2024
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maik Nauka/Interperiodica/Springer
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The closeness parameter stands as a widely investigated metric within the domain of assessing the stability and vulnerability of intricate network configurations. Within the scope of this inquiry, our focus resides upon the evaluation of closeness values attributed to central graphs, a significant form of graph structure. Our initial pursuit encompasses the computation of closeness values within some special graph structures and their complement graphs of the central graphs. Subsequently, we achieve general outcomes pertaining to central graphs. Ultimately, we furnish a lower bound for a result of the Nordhaus-Gaddum type.
Açıklama
Anahtar Kelimeler
closeness, graph vulnerability, Nordhaus–Gaddum
Kaynak
Mathematical Notes
WoS Q Değeri
Q3
Scopus Q Değeri
Q3
Cilt
116
Sayı
3-4
Künye
Goelpek, H. T., & Aytac, A. O. (2024). Determining vulnerability of central networks using closeness and Nordhaus–Gaddum type relation. Mathematical Notes, 116(3), 614-626
