Determining Vulnerability of Central Networks Using Closeness and Nordhaus–Gaddum Type Relation
Articles > Article · 2024
Authors: H. T. Gölpek, Aysun AYTAÇ
Mathematical Notes, International, WoS, 2024, vol 116, pp 614-626
DOI: 10.1134/s0001434624090219
Summary
Abstract 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.